/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:25:47,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:25:47,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:25:47,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:25:47,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:25:47,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:25:47,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:25:47,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:25:47,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:25:47,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:25:47,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:25:47,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:25:47,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:25:47,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:25:47,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:25:47,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:25:47,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:25:47,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:25:47,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:25:47,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:25:47,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:25:47,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:25:47,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:25:47,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:25:47,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:25:47,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:25:47,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:25:47,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:25:47,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:25:47,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:25:47,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:25:47,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:25:47,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:25:47,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:25:47,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:25:47,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:25:47,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:25:47,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:25:47,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:25:47,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:25:47,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:25:47,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:25:47,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:25:47,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:25:47,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:25:47,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:25:47,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:25:47,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:25:47,475 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:25:47,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:25:47,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:25:47,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:25:47,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:25:47,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:25:47,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:25:47,476 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:25:47,476 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:25:47,476 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:25:47,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:25:47,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:25:47,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:25:47,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:25:47,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:25:47,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:25:47,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:25:47,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:25:47,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:25:47,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:25:47,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:25:47,478 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:25:47,478 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:25:47,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:25:47,478 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:25:47,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:25:47,479 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:25:47,479 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 05:25:47,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:25:47,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:25:47,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:25:47,700 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:25:47,700 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:25:47,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i [2022-01-11 05:25:47,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45fe78d5b/e626a37a868d4c92a8ddef9181967c4e/FLAGcf0798f83 [2022-01-11 05:25:48,249 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:25:48,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i [2022-01-11 05:25:48,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45fe78d5b/e626a37a868d4c92a8ddef9181967c4e/FLAGcf0798f83 [2022-01-11 05:25:48,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45fe78d5b/e626a37a868d4c92a8ddef9181967c4e [2022-01-11 05:25:48,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:25:48,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:25:48,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:25:48,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:25:48,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:25:48,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:25:48" (1/1) ... [2022-01-11 05:25:48,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c63a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:48, skipping insertion in model container [2022-01-11 05:25:48,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:25:48" (1/1) ... [2022-01-11 05:25:48,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:25:48,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:25:48,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i[24538,24551] [2022-01-11 05:25:48,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:25:48,928 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:25:48,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i[24538,24551] [2022-01-11 05:25:48,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:25:49,007 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:25:49,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:49 WrapperNode [2022-01-11 05:25:49,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:25:49,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:25:49,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:25:49,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:25:49,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:49" (1/1) ... [2022-01-11 05:25:49,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:49" (1/1) ... [2022-01-11 05:25:49,061 INFO L137 Inliner]: procedures = 129, calls = 29, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 145 [2022-01-11 05:25:49,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:25:49,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:25:49,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:25:49,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:25:49,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:49" (1/1) ... [2022-01-11 05:25:49,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:49" (1/1) ... [2022-01-11 05:25:49,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:49" (1/1) ... [2022-01-11 05:25:49,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:49" (1/1) ... [2022-01-11 05:25:49,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:49" (1/1) ... [2022-01-11 05:25:49,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:49" (1/1) ... [2022-01-11 05:25:49,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:49" (1/1) ... [2022-01-11 05:25:49,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:25:49,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:25:49,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:25:49,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:25:49,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:49" (1/1) ... [2022-01-11 05:25:49,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:25:49,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:49,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 05:25:49,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 05:25:49,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:25:49,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:25:49,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:25:49,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:25:49,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:25:49,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:25:49,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:25:49,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:25:49,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:25:49,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:25:49,321 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:25:49,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:25:49,612 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:25:49,617 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:25:49,617 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-11 05:25:49,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:25:49 BoogieIcfgContainer [2022-01-11 05:25:49,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:25:49,619 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:25:49,619 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:25:49,625 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:25:49,628 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:25:49" (1/1) ... [2022-01-11 05:25:49,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:25:49 BasicIcfg [2022-01-11 05:25:49,729 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:25:49,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:25:49,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:25:49,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:25:49,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:25:48" (1/4) ... [2022-01-11 05:25:49,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da03e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:25:49, skipping insertion in model container [2022-01-11 05:25:49,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:49" (2/4) ... [2022-01-11 05:25:49,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da03e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:25:49, skipping insertion in model container [2022-01-11 05:25:49,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:25:49" (3/4) ... [2022-01-11 05:25:49,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da03e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:25:49, skipping insertion in model container [2022-01-11 05:25:49,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:25:49" (4/4) ... [2022-01-11 05:25:49,736 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.iTransformedIcfg [2022-01-11 05:25:49,740 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:25:49,741 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:25:49,786 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:25:49,793 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 05:25:49,793 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:25:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 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-11 05:25:49,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 05:25:49,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:49,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:49,808 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:49,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:49,812 INFO L85 PathProgramCache]: Analyzing trace with hash -327494694, now seen corresponding path program 1 times [2022-01-11 05:25:49,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:49,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885431898] [2022-01-11 05:25:49,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:49,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:25:50,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:50,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885431898] [2022-01-11 05:25:50,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885431898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:25:50,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:25:50,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:25:50,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968183592] [2022-01-11 05:25:50,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:50,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:25:50,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:50,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:25:50,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:25:50,070 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:50,084 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-01-11 05:25:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:25:50,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-11 05:25:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:50,092 INFO L225 Difference]: With dead ends: 61 [2022-01-11 05:25:50,092 INFO L226 Difference]: Without dead ends: 27 [2022-01-11 05:25:50,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:25:50,097 INFO L933 BasicCegarLoop]: 46 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, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:50,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:25:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-11 05:25:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-11 05:25:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-01-11 05:25:50,121 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2022-01-11 05:25:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:50,121 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-01-11 05:25:50,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-01-11 05:25:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 05:25:50,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:50,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:50,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:25:50,123 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:50,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1416239162, now seen corresponding path program 1 times [2022-01-11 05:25:50,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:50,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967931834] [2022-01-11 05:25:50,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:50,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:25:50,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:50,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967931834] [2022-01-11 05:25:50,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967931834] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:25:50,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:25:50,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:25:50,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471983693] [2022-01-11 05:25:50,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:50,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:25:50,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:50,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:25:50,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:25:50,274 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:50,306 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-01-11 05:25:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:25:50,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-11 05:25:50,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:50,307 INFO L225 Difference]: With dead ends: 44 [2022-01-11 05:25:50,307 INFO L226 Difference]: Without dead ends: 28 [2022-01-11 05:25:50,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:25:50,311 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:50,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:25:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-11 05:25:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-11 05:25:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-01-11 05:25:50,319 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 16 [2022-01-11 05:25:50,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:50,321 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-01-11 05:25:50,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:50,326 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-01-11 05:25:50,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 05:25:50,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:50,327 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] [2022-01-11 05:25:50,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:25:50,327 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:50,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1321570061, now seen corresponding path program 1 times [2022-01-11 05:25:50,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:50,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876622639] [2022-01-11 05:25:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:50,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:50,487 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-11 05:25:50,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:50,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876622639] [2022-01-11 05:25:50,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876622639] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:25:50,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:25:50,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 05:25:50,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70403070] [2022-01-11 05:25:50,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:50,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 05:25:50,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:50,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 05:25:50,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:25:50,491 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:50,544 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-01-11 05:25:50,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:25:50,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-11 05:25:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:50,546 INFO L225 Difference]: With dead ends: 50 [2022-01-11 05:25:50,546 INFO L226 Difference]: Without dead ends: 41 [2022-01-11 05:25:50,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:25:50,547 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:50,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 102 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:25:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-11 05:25:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-01-11 05:25:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 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-11 05:25:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-01-11 05:25:50,551 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 22 [2022-01-11 05:25:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:50,552 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-01-11 05:25:50,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-01-11 05:25:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-11 05:25:50,552 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:50,552 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-11 05:25:50,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:25:50,553 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:50,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:50,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1439046502, now seen corresponding path program 1 times [2022-01-11 05:25:50,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:50,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233715287] [2022-01-11 05:25:50,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:50,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:50,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:50,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233715287] [2022-01-11 05:25:50,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233715287] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:50,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44792438] [2022-01-11 05:25:50,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:50,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:50,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:50,728 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:25:50,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 05:25:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:51,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-11 05:25:51,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:25:51,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:25:51,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44792438] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:25:51,403 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:25:51,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-01-11 05:25:51,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111157386] [2022-01-11 05:25:51,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:25:51,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-11 05:25:51,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:51,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-11 05:25:51,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:25:51,404 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:51,483 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-01-11 05:25:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:25:51,484 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-11 05:25:51,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:51,484 INFO L225 Difference]: With dead ends: 68 [2022-01-11 05:25:51,485 INFO L226 Difference]: Without dead ends: 59 [2022-01-11 05:25:51,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-01-11 05:25:51,486 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 88 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:51,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 145 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:25:51,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-11 05:25:51,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2022-01-11 05:25:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 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-11 05:25:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-01-11 05:25:51,497 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 27 [2022-01-11 05:25:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:51,498 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-01-11 05:25:51,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-01-11 05:25:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-11 05:25:51,511 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:51,511 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:51,539 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-11 05:25:51,727 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-11 05:25:51,728 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1406009133, now seen corresponding path program 2 times [2022-01-11 05:25:51,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:51,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916221589] [2022-01-11 05:25:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:51,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:51,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:51,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916221589] [2022-01-11 05:25:51,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916221589] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:51,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380038098] [2022-01-11 05:25:51,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:25:51,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:51,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:51,841 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:25:51,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-11 05:25:53,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:25:53,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:25:53,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-11 05:25:53,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:54,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:54,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380038098] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:25:54,142 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:25:54,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-01-11 05:25:54,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503946686] [2022-01-11 05:25:54,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:25:54,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-11 05:25:54,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:54,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-11 05:25:54,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:25:54,143 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-11 05:25:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:54,298 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2022-01-11 05:25:54,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 05:25:54,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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) Word has length 32 [2022-01-11 05:25:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:54,299 INFO L225 Difference]: With dead ends: 73 [2022-01-11 05:25:54,299 INFO L226 Difference]: Without dead ends: 59 [2022-01-11 05:25:54,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:25:54,300 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 93 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:54,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 128 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:25:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-11 05:25:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2022-01-11 05:25:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-01-11 05:25:54,306 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 32 [2022-01-11 05:25:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:54,307 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-01-11 05:25:54,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-11 05:25:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-01-11 05:25:54,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-11 05:25:54,307 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:54,307 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:54,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-11 05:25:54,514 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-11 05:25:54,514 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:54,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1716659722, now seen corresponding path program 1 times [2022-01-11 05:25:54,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:54,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765752807] [2022-01-11 05:25:54,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:54,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:25:55,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:55,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765752807] [2022-01-11 05:25:55,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765752807] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:55,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90442182] [2022-01-11 05:25:55,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:55,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:55,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:55,471 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:25:55,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-11 05:25:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:55,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 94 conjunts are in the unsatisfiable core [2022-01-11 05:25:55,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:55,720 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-11 05:25:55,782 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:25:55,782 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-11 05:25:55,852 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-11 05:25:55,882 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-11 05:25:55,966 INFO L353 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-01-11 05:25:55,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 71 [2022-01-11 05:25:55,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57 [2022-01-11 05:25:55,976 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 12 treesize of output 11 [2022-01-11 05:25:55,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-11 05:25:55,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-11 05:25:56,220 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 17 treesize of output 13 [2022-01-11 05:25:56,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:56,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:56,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2022-01-11 05:25:56,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2022-01-11 05:25:56,469 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 16 treesize of output 18 [2022-01-11 05:25:56,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:56,631 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:56,631 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 21 treesize of output 10 [2022-01-11 05:25:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:25:56,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:56,934 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616)) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (forall ((v_ArrVal_557 (Array Int Int))) (<= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616))))) is different from false [2022-01-11 05:25:56,980 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616)) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (forall ((v_ArrVal_557 (Array Int Int))) (<= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616))))) is different from false [2022-01-11 05:25:56,990 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616)) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (forall ((v_ArrVal_557 (Array Int Int))) (<= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616))))) is different from false [2022-01-11 05:25:57,024 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:57,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-01-11 05:25:57,033 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:57,034 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 78 treesize of output 81 [2022-01-11 05:25:57,039 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 31 treesize of output 25 [2022-01-11 05:25:57,104 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:57,105 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 44 treesize of output 45 [2022-01-11 05:25:57,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 62 [2022-01-11 05:25:57,124 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 31 treesize of output 25 [2022-01-11 05:25:57,373 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_556 Int)) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| (select (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_556) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)))) is different from false [2022-01-11 05:25:57,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_556 Int)) (not (= (select (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_556) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|))) is different from false [2022-01-11 05:25:57,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_556 Int)) (not (= (select (store (store (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_548) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_556) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|))) is different from false [2022-01-11 05:25:57,404 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:57,405 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 36 treesize of output 37 [2022-01-11 05:25:57,408 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 121 treesize of output 117 [2022-01-11 05:25:57,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:57,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:57,413 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 82 treesize of output 78 [2022-01-11 05:25:57,415 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 137 treesize of output 133 [2022-01-11 05:25:57,420 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 72 treesize of output 70 [2022-01-11 05:25:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-11 05:25:57,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90442182] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:25:57,683 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:25:57,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 49 [2022-01-11 05:25:57,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909898882] [2022-01-11 05:25:57,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:25:57,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-01-11 05:25:57,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-01-11 05:25:57,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1685, Unknown=6, NotChecked=522, Total=2352 [2022-01-11 05:25:57,686 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 49 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-11 05:25:59,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:59,866 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2022-01-11 05:25:59,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-11 05:25:59,866 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 49 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) Word has length 33 [2022-01-11 05:25:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:59,868 INFO L225 Difference]: With dead ends: 91 [2022-01-11 05:25:59,868 INFO L226 Difference]: Without dead ends: 89 [2022-01-11 05:25:59,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=412, Invalid=3638, Unknown=6, NotChecked=774, Total=4830 [2022-01-11 05:25:59,870 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 153 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:59,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 445 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 659 Invalid, 0 Unknown, 461 Unchecked, 0.7s Time] [2022-01-11 05:25:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-11 05:25:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-01-11 05:25:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-01-11 05:25:59,882 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 33 [2022-01-11 05:25:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:59,882 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-01-11 05:25:59,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 49 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-11 05:25:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-01-11 05:25:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-11 05:25:59,883 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:59,883 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:59,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-11 05:26:00,102 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-11 05:26:00,103 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:00,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:00,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1649652969, now seen corresponding path program 1 times [2022-01-11 05:26:00,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:00,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045090224] [2022-01-11 05:26:00,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:00,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 05:26:00,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:00,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045090224] [2022-01-11 05:26:00,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045090224] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:26:00,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:26:00,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 05:26:00,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48236984] [2022-01-11 05:26:00,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:00,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 05:26:00,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:00,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 05:26:00,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:26:00,200 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:00,254 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-01-11 05:26:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 05:26:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-11 05:26:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:00,255 INFO L225 Difference]: With dead ends: 90 [2022-01-11 05:26:00,255 INFO L226 Difference]: Without dead ends: 61 [2022-01-11 05:26:00,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-11 05:26:00,256 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 62 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:00,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 48 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:26:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-11 05:26:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-01-11 05:26:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-01-11 05:26:00,267 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 33 [2022-01-11 05:26:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:00,267 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-01-11 05:26:00,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-01-11 05:26:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 05:26:00,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:00,268 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:00,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 05:26:00,268 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:00,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:00,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1700673840, now seen corresponding path program 1 times [2022-01-11 05:26:00,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:00,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220635531] [2022-01-11 05:26:00,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:00,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:26:00,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:00,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220635531] [2022-01-11 05:26:00,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220635531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:26:00,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:26:00,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 05:26:00,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686965906] [2022-01-11 05:26:00,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:00,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 05:26:00,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:00,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 05:26:00,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 05:26:00,334 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:00,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:00,366 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-01-11 05:26:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:26:00,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-11 05:26:00,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:00,367 INFO L225 Difference]: With dead ends: 78 [2022-01-11 05:26:00,367 INFO L226 Difference]: Without dead ends: 70 [2022-01-11 05:26:00,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:26:00,368 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:00,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 79 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:26:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-11 05:26:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-01-11 05:26:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2022-01-11 05:26:00,379 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 34 [2022-01-11 05:26:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:00,380 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2022-01-11 05:26:00,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-01-11 05:26:00,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 05:26:00,380 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:00,380 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:00,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 05:26:00,381 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:00,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:00,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1538073907, now seen corresponding path program 2 times [2022-01-11 05:26:00,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:00,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351468095] [2022-01-11 05:26:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:00,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:00,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:00,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351468095] [2022-01-11 05:26:00,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351468095] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:00,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289608327] [2022-01-11 05:26:00,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:26:00,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:00,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:00,496 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-11 05:26:00,497 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-11 05:26:01,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:26:01,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:26:01,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-11 05:26:01,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:01,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:36,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289608327] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:36,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:36,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 17 [2022-01-11 05:26:36,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60730236] [2022-01-11 05:26:36,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:36,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-11 05:26:36,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-11 05:26:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=204, Unknown=3, NotChecked=0, Total=272 [2022-01-11 05:26:36,718 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:36,999 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2022-01-11 05:26:36,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 05:26:37,000 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 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-11 05:26:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:37,000 INFO L225 Difference]: With dead ends: 100 [2022-01-11 05:26:37,000 INFO L226 Difference]: Without dead ends: 78 [2022-01-11 05:26:37,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=162, Invalid=387, Unknown=3, NotChecked=0, Total=552 [2022-01-11 05:26:37,001 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 165 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:37,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 197 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 70 Invalid, 0 Unknown, 4 Unchecked, 0.1s Time] [2022-01-11 05:26:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-11 05:26:37,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2022-01-11 05:26:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-01-11 05:26:37,019 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 34 [2022-01-11 05:26:37,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:37,020 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-01-11 05:26:37,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-01-11 05:26:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-11 05:26:37,024 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:37,024 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:37,032 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-11 05:26:37,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:37,231 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:37,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:37,232 INFO L85 PathProgramCache]: Analyzing trace with hash 298039065, now seen corresponding path program 1 times [2022-01-11 05:26:37,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:37,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674815479] [2022-01-11 05:26:37,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:37,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:26:37,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:37,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674815479] [2022-01-11 05:26:37,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674815479] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:37,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593601597] [2022-01-11 05:26:37,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:37,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:37,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:37,344 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-11 05:26:37,345 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-11 05:26:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:37,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-11 05:26:37,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:37,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:26:37,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593601597] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:37,773 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:37,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 10 [2022-01-11 05:26:37,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361704733] [2022-01-11 05:26:37,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:37,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 05:26:37,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:37,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 05:26:37,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-11 05:26:37,774 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 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-11 05:26:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:37,950 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2022-01-11 05:26:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 05:26:37,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 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) Word has length 39 [2022-01-11 05:26:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:37,951 INFO L225 Difference]: With dead ends: 95 [2022-01-11 05:26:37,951 INFO L226 Difference]: Without dead ends: 87 [2022-01-11 05:26:37,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-01-11 05:26:37,952 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:37,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 203 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:26:37,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-11 05:26:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2022-01-11 05:26:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-01-11 05:26:37,966 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 39 [2022-01-11 05:26:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:37,967 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-01-11 05:26:37,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 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-11 05:26:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-01-11 05:26:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-11 05:26:37,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:37,968 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:37,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-11 05:26:38,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-11 05:26:38,184 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1244631930, now seen corresponding path program 3 times [2022-01-11 05:26:38,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:38,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755439379] [2022-01-11 05:26:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:38,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:26:38,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:38,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755439379] [2022-01-11 05:26:38,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755439379] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:38,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710936205] [2022-01-11 05:26:38,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-11 05:26:38,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:38,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:38,348 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-11 05:26:38,349 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-11 05:26:42,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-11 05:26:42,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:26:42,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-11 05:26:42,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:26:42,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:42,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710936205] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:42,854 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:42,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 19 [2022-01-11 05:26:42,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75423598] [2022-01-11 05:26:42,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:42,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-11 05:26:42,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:42,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-11 05:26:42,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-01-11 05:26:42,858 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:42,996 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-01-11 05:26:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 05:26:42,997 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-01-11 05:26:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:42,997 INFO L225 Difference]: With dead ends: 89 [2022-01-11 05:26:42,997 INFO L226 Difference]: Without dead ends: 69 [2022-01-11 05:26:42,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-01-11 05:26:42,998 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 121 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:42,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 241 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:26:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-11 05:26:43,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-01-11 05:26:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-01-11 05:26:43,009 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 39 [2022-01-11 05:26:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:43,009 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-01-11 05:26:43,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-01-11 05:26:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-11 05:26:43,009 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:43,009 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:43,017 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-11 05:26:43,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:43,212 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:43,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1338953623, now seen corresponding path program 4 times [2022-01-11 05:26:43,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:43,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411839322] [2022-01-11 05:26:43,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:43,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 05:26:43,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:43,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411839322] [2022-01-11 05:26:43,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411839322] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:43,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642199764] [2022-01-11 05:26:43,328 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-11 05:26:43,328 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:43,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:43,329 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-11 05:26:43,330 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-11 05:26:43,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-11 05:26:43,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:26:43,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-11 05:26:43,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 05:26:43,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 05:26:44,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642199764] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:44,018 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:44,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-11 05:26:44,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431324413] [2022-01-11 05:26:44,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:44,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 05:26:44,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:44,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 05:26:44,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:26:44,019 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:44,037 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-01-11 05:26:44,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:26:44,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 39 [2022-01-11 05:26:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:44,037 INFO L225 Difference]: With dead ends: 76 [2022-01-11 05:26:44,037 INFO L226 Difference]: Without dead ends: 41 [2022-01-11 05:26:44,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:26:44,038 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:44,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 64 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:26:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-11 05:26:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-01-11 05:26:44,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-01-11 05:26:44,060 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-01-11 05:26:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:44,060 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-01-11 05:26:44,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-01-11 05:26:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-11 05:26:44,061 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:44,061 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:44,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-11 05:26:44,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:44,262 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:44,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:44,263 INFO L85 PathProgramCache]: Analyzing trace with hash 673106433, now seen corresponding path program 1 times [2022-01-11 05:26:44,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:44,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537480483] [2022-01-11 05:26:44,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:44,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:26:45,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:45,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537480483] [2022-01-11 05:26:45,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537480483] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:45,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285895955] [2022-01-11 05:26:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:45,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:45,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:45,347 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:45,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-11 05:26:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:45,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 119 conjunts are in the unsatisfiable core [2022-01-11 05:26:45,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:45,587 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-11 05:26:45,676 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:26:45,677 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-11 05:26:45,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-11 05:26:45,809 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:26:45,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2022-01-11 05:26:45,913 INFO L353 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-01-11 05:26:45,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 62 [2022-01-11 05:26:45,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-01-11 05:26:45,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-11 05:26:45,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-11 05:26:45,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-11 05:26:46,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:46,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:46,102 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:46,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2022-01-11 05:26:46,108 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 6 treesize of output 5 [2022-01-11 05:26:46,354 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:26:46,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2022-01-11 05:26:46,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-01-11 05:26:46,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:46,365 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 34 treesize of output 36 [2022-01-11 05:26:46,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2022-01-11 05:26:46,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-01-11 05:26:46,924 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 25 treesize of output 9 [2022-01-11 05:26:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:26:47,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:47,482 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 134 treesize of output 100 [2022-01-11 05:26:47,500 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 134 treesize of output 100 [2022-01-11 05:26:47,516 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (forall ((v_ArrVal_1498 (Array Int Int))) (= (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1498) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ 16 .cse0) 18446744073709551616)) 16 .cse0)) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616))) (<= .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) (forall ((v_ArrVal_1499 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (<= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| .cse1))) is different from false [2022-01-11 05:26:47,536 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (forall ((v_ArrVal_1499 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (forall ((v_ArrVal_1498 (Array Int Int))) (= (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) v_ArrVal_1498) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ .cse1 16 (* (- 18446744073709551616) (div (+ .cse1 16) 18446744073709551616)))) (mod (+ 16 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|)) 18446744073709551616))) (<= .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) (<= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| .cse2))) is different from false [2022-01-11 05:26:47,558 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967296))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_1499 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse2 (select (select (store |c_#memory_$Pointer$.baseInt| .cse2 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (forall ((v_ArrVal_1498 (Array Int Int))) (= (mod (+ (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 16) 18446744073709551616) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) v_ArrVal_1498) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ 16 .cse3) 18446744073709551616)) 16 .cse3)))) (<= .cse1 .cse0))) is different from false [2022-01-11 05:26:47,571 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (forall ((v_ArrVal_1499 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (forall ((v_ArrVal_1498 (Array Int Int))) (= (mod (+ (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 16) 18446744073709551616) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) v_ArrVal_1498) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ 16 .cse1) 18446744073709551616)) 16 .cse1)))) (<= .cse2 .cse3) (<= .cse3 .cse2))) is different from false [2022-01-11 05:26:47,617 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 326 treesize of output 294 [2022-01-11 05:26:47,623 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 294 treesize of output 278 [2022-01-11 05:26:47,627 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 278 treesize of output 262 [2022-01-11 05:26:47,873 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296)) (.cse2 (forall ((v_ArrVal_1494 Int)) (not (= (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616) v_ArrVal_1494)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) .cse2 (or (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) .cse2) (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616) v_ArrVal_1494)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))))))) is different from false [2022-01-11 05:26:47,914 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((v_ArrVal_1494 Int)) (not (= (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616) v_ArrVal_1494)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616) v_ArrVal_1494)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse2 (select (select (store .cse3 .cse2 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))))))) is different from false [2022-01-11 05:26:47,930 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| .cse1) .cse0 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))))) (<= .cse2 .cse3) (<= .cse3 .cse2) (forall ((v_ArrVal_1494 Int)) (not (= (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))))) is different from false [2022-01-11 05:26:47,939 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt| .cse0) .cse1 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) .cse1)))) (forall ((v_ArrVal_1494 Int)) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt| (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|))))) is different from false [2022-01-11 05:26:47,953 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (let ((.cse0 (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1491) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_1494))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|))) (= (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1492) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| .cse0) .cse1 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) .cse1)))) (forall ((v_ArrVal_1494 Int) (v_ArrVal_1491 (Array Int Int))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| (select (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1491) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_1494) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|))))) is different from false [2022-01-11 05:26:47,974 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (let ((.cse1 (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1491) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))) (= .cse0 (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1492) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse1) .cse0 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))))) (forall ((v_ArrVal_1494 Int) (v_ArrVal_1491 (Array Int Int))) (not (= (select (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1491) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|)))) is different from false [2022-01-11 05:26:47,997 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1494 Int) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| (select (store (store (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_1488) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1491) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)))) (forall ((v_ArrVal_1494 Int) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_1488))) (let ((.cse1 (store (store (select (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1491) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1492) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse1) .cse2 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) .cse2)))))) is different from false [2022-01-11 05:26:48,006 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:48,006 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 36 treesize of output 37 [2022-01-11 05:26:48,010 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 243 treesize of output 237 [2022-01-11 05:26:48,023 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 341 treesize of output 335 [2022-01-11 05:26:48,028 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 162 treesize of output 158 [2022-01-11 05:26:48,041 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 162 treesize of output 158 [2022-01-11 05:26:48,062 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 72 treesize of output 70 [2022-01-11 05:26:48,094 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-11 05:26:48,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 1 [2022-01-11 05:26:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-01-11 05:26:48,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285895955] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:48,330 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:48,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 25] total 62 [2022-01-11 05:26:48,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204778632] [2022-01-11 05:26:48,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:48,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-01-11 05:26:48,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:48,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-01-11 05:26:48,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2430, Unknown=11, NotChecked=1188, Total=3782 [2022-01-11 05:26:48,332 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 62 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:50,828 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-01-11 05:26:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-11 05:26:50,829 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 62 states have internal predecessors, (108), 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 40 [2022-01-11 05:26:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:50,830 INFO L225 Difference]: With dead ends: 47 [2022-01-11 05:26:50,830 INFO L226 Difference]: Without dead ends: 42 [2022-01-11 05:26:50,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 79 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=363, Invalid=4500, Unknown=11, NotChecked=1606, Total=6480 [2022-01-11 05:26:50,834 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 121 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:50,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 415 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 769 Invalid, 0 Unknown, 389 Unchecked, 0.7s Time] [2022-01-11 05:26:50,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-11 05:26:50,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-01-11 05:26:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 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-11 05:26:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-01-11 05:26:50,856 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-01-11 05:26:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:50,857 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-01-11 05:26:50,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-01-11 05:26:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-11 05:26:50,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:50,858 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:50,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-11 05:26:51,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-11 05:26:51,074 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash -584707047, now seen corresponding path program 2 times [2022-01-11 05:26:51,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:51,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271581100] [2022-01-11 05:26:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:51,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:26:51,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:51,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271581100] [2022-01-11 05:26:51,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271581100] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:51,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202221834] [2022-01-11 05:26:51,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:26:51,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:51,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:51,176 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:51,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-11 05:26:52,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:26:52,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:26:52,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-11 05:26:52,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:52,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:26:53,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202221834] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:53,017 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:53,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 16 [2022-01-11 05:26:53,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311127904] [2022-01-11 05:26:53,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:53,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-11 05:26:53,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:53,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-11 05:26:53,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-11 05:26:53,018 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:53,111 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-01-11 05:26:53,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 05:26:53,111 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 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 41 [2022-01-11 05:26:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:53,111 INFO L225 Difference]: With dead ends: 42 [2022-01-11 05:26:53,111 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 05:26:53,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-01-11 05:26:53,112 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:53,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 172 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 58 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-01-11 05:26:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 05:26:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 05:26:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 05:26:53,113 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-01-11 05:26:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:53,113 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 05:26:53,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 05:26:53,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 05:26:53,115 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 05:26:53,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-11 05:26:53,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-11 05:26:53,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.