/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_remove_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 11:58:50,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 11:58:50,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 11:58:50,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 11:58:50,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 11:58:50,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 11:58:50,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 11:58:50,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 11:58:50,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 11:58:50,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 11:58:50,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 11:58:50,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 11:58:50,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 11:58:50,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 11:58:50,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 11:58:50,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 11:58:50,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 11:58:50,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 11:58:50,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 11:58:50,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 11:58:50,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 11:58:50,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 11:58:50,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 11:58:50,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 11:58:50,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 11:58:50,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 11:58:50,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 11:58:50,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 11:58:50,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 11:58:50,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 11:58:50,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 11:58:50,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 11:58:50,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 11:58:50,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 11:58:50,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 11:58:50,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 11:58:50,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 11:58:50,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 11:58:50,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 11:58:50,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 11:58:50,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 11:58:50,087 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 11:58:50,108 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 11:58:50,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 11:58:50,109 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 11:58:50,109 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 11:58:50,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 11:58:50,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 11:58:50,110 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 11:58:50,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 11:58:50,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 11:58:50,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 11:58:50,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 11:58:50,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 11:58:50,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 11:58:50,111 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 11:58:50,111 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 11:58:50,111 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 11:58:50,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 11:58:50,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 11:58:50,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 11:58:50,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 11:58:50,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 11:58:50,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:58:50,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 11:58:50,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 11:58:50,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 11:58:50,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 11:58:50,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 11:58:50,112 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 11:58:50,112 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 11:58:50,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 11:58:50,112 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 11:58:50,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 11:58:50,113 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 11:58:50,113 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 11:58:50,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 11:58:50,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 11:58:50,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 11:58:50,294 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 11:58:50,295 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 11:58:50,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_remove_all_reverse.i [2022-01-10 11:58:50,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677e915c9/fda53578719c4af79faea247425e3c6a/FLAG11f835796 [2022-01-10 11:58:50,746 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 11:58:50,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all_reverse.i [2022-01-10 11:58:50,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677e915c9/fda53578719c4af79faea247425e3c6a/FLAG11f835796 [2022-01-10 11:58:50,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677e915c9/fda53578719c4af79faea247425e3c6a [2022-01-10 11:58:50,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 11:58:50,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 11:58:50,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 11:58:50,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 11:58:50,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 11:58:50,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:58:50" (1/1) ... [2022-01-10 11:58:50,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1805f127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:50, skipping insertion in model container [2022-01-10 11:58:50,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:58:50" (1/1) ... [2022-01-10 11:58:50,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 11:58:50,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:58:51,016 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/dll2n_remove_all_reverse.i[24275,24288] [2022-01-10 11:58:51,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:58:51,024 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 11:58:51,054 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/dll2n_remove_all_reverse.i[24275,24288] [2022-01-10 11:58:51,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:58:51,072 INFO L208 MainTranslator]: Completed translation [2022-01-10 11:58:51,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:51 WrapperNode [2022-01-10 11:58:51,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 11:58:51,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 11:58:51,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 11:58:51,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 11:58:51,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:51" (1/1) ... [2022-01-10 11:58:51,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:51" (1/1) ... [2022-01-10 11:58:51,123 INFO L137 Inliner]: procedures = 129, calls = 35, calls flagged for inlining = 6, calls inlined = 5, statements flattened = 99 [2022-01-10 11:58:51,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 11:58:51,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 11:58:51,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 11:58:51,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 11:58:51,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:51" (1/1) ... [2022-01-10 11:58:51,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:51" (1/1) ... [2022-01-10 11:58:51,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:51" (1/1) ... [2022-01-10 11:58:51,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:51" (1/1) ... [2022-01-10 11:58:51,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:51" (1/1) ... [2022-01-10 11:58:51,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:51" (1/1) ... [2022-01-10 11:58:51,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:51" (1/1) ... [2022-01-10 11:58:51,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 11:58:51,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 11:58:51,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 11:58:51,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 11:58:51,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:51" (1/1) ... [2022-01-10 11:58:51,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:58:51,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:58:51,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 11:58:51,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 11:58:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 11:58:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 11:58:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 11:58:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 11:58:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 11:58:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 11:58:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 11:58:51,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 11:58:51,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 11:58:51,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 11:58:51,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 11:58:51,312 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 11:58:51,313 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 11:58:51,520 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 11:58:51,524 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 11:58:51,524 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 11:58:51,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:58:51 BoogieIcfgContainer [2022-01-10 11:58:51,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 11:58:51,526 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 11:58:51,526 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 11:58:51,527 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 11:58:51,529 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:58:51" (1/1) ... [2022-01-10 11:58:51,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:58:51 BasicIcfg [2022-01-10 11:58:51,581 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 11:58:51,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 11:58:51,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 11:58:51,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 11:58:51,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:58:50" (1/4) ... [2022-01-10 11:58:51,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0b7d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:58:51, skipping insertion in model container [2022-01-10 11:58:51,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:51" (2/4) ... [2022-01-10 11:58:51,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0b7d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:58:51, skipping insertion in model container [2022-01-10 11:58:51,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:58:51" (3/4) ... [2022-01-10 11:58:51,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0b7d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:58:51, skipping insertion in model container [2022-01-10 11:58:51,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:58:51" (4/4) ... [2022-01-10 11:58:51,586 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.iTransformedIcfg [2022-01-10 11:58:51,589 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 11:58:51,589 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 11:58:51,617 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 11:58:51,621 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 11:58:51,621 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 11:58:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 11:58:51,633 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:51,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:58:51,634 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:51,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:51,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1346821475, now seen corresponding path program 1 times [2022-01-10 11:58:51,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:51,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83285818] [2022-01-10 11:58:51,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:51,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:58:51,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:51,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83285818] [2022-01-10 11:58:51,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83285818] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:58:51,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:58:51,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 11:58:51,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714348586] [2022-01-10 11:58:51,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:58:51,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 11:58:51,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:51,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 11:58:51,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:58:51,843 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:51,854 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-01-10 11:58:51,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 11:58:51,855 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-01-10 11:58:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:51,861 INFO L225 Difference]: With dead ends: 40 [2022-01-10 11:58:51,861 INFO L226 Difference]: Without dead ends: 20 [2022-01-10 11:58:51,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:58:51,865 INFO L933 BasicCegarLoop]: 29 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, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:58:51,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:58:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-10 11:58:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-01-10 11:58:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-01-10 11:58:51,885 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 9 [2022-01-10 11:58:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:51,885 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-01-10 11:58:51,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-01-10 11:58:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 11:58:51,886 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:51,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:58:51,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 11:58:51,887 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:51,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash -459288003, now seen corresponding path program 1 times [2022-01-10 11:58:51,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:51,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944045601] [2022-01-10 11:58:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:51,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:58:52,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:52,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944045601] [2022-01-10 11:58:52,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944045601] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:58:52,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:58:52,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 11:58:52,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062231296] [2022-01-10 11:58:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:58:52,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:58:52,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:58:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:58:52,061 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:52,213 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-01-10 11:58:52,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 11:58:52,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-01-10 11:58:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:52,214 INFO L225 Difference]: With dead ends: 54 [2022-01-10 11:58:52,215 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 11:58:52,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 11:58:52,216 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:58:52,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 72 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:58:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 11:58:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-01-10 11:58:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-01-10 11:58:52,222 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 9 [2022-01-10 11:58:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:52,225 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-01-10 11:58:52,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-01-10 11:58:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 11:58:52,228 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:52,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:58:52,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 11:58:52,229 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1453476934, now seen corresponding path program 1 times [2022-01-10 11:58:52,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:52,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067142487] [2022-01-10 11:58:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:52,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:58:52,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:52,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067142487] [2022-01-10 11:58:52,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067142487] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:58:52,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:58:52,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:58:52,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942286873] [2022-01-10 11:58:52,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:58:52,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:58:52,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:52,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:58:52,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:58:52,378 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:52,402 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-01-10 11:58:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 11:58:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 11:58:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:52,403 INFO L225 Difference]: With dead ends: 35 [2022-01-10 11:58:52,404 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 11:58:52,404 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-10 11:58:52,405 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:58:52,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:58:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 11:58:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-01-10 11:58:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-01-10 11:58:52,408 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2022-01-10 11:58:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:52,408 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-01-10 11:58:52,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-01-10 11:58:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 11:58:52,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:52,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:58:52,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 11:58:52,409 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:52,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash 150822960, now seen corresponding path program 1 times [2022-01-10 11:58:52,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:52,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585043045] [2022-01-10 11:58:52,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:52,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:58:52,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:52,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585043045] [2022-01-10 11:58:52,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585043045] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:58:52,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:58:52,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 11:58:52,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130979455] [2022-01-10 11:58:52,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:58:52,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:58:52,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:52,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:58:52,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:58:52,531 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:52,610 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-01-10 11:58:52,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 11:58:52,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 11:58:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:52,612 INFO L225 Difference]: With dead ends: 36 [2022-01-10 11:58:52,612 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 11:58:52,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-10 11:58:52,619 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:58:52,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 61 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:58:52,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 11:58:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-10 11:58:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-01-10 11:58:52,628 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-01-10 11:58:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:52,628 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-01-10 11:58:52,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-01-10 11:58:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 11:58:52,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:52,629 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] [2022-01-10 11:58:52,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 11:58:52,629 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:52,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1608227372, now seen corresponding path program 1 times [2022-01-10 11:58:52,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:52,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224135714] [2022-01-10 11:58:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:52,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:58:52,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:52,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224135714] [2022-01-10 11:58:52,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224135714] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:58:52,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999626262] [2022-01-10 11:58:52,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:52,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:58:52,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:58:52,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:58:52,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 11:58:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:52,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-10 11:58:52,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:58:53,024 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:58:53,024 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 63 [2022-01-10 11:58:53,034 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:58:53,035 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2022-01-10 11:58:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:58:53,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 11:58:53,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999626262] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:58:53,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 11:58:53,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2022-01-10 11:58:53,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862257249] [2022-01-10 11:58:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:58:53,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 11:58:53,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:53,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 11:58:53,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 11:58:53,082 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:53,109 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-01-10 11:58:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:58:53,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 11:58:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:53,110 INFO L225 Difference]: With dead ends: 38 [2022-01-10 11:58:53,110 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 11:58:53,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 11:58:53,111 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:58:53,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-01-10 11:58:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 11:58:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-10 11:58:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-01-10 11:58:53,115 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2022-01-10 11:58:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:53,115 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-01-10 11:58:53,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-01-10 11:58:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 11:58:53,115 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:53,116 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:58:53,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 11:58:53,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:58:53,333 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:53,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:53,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1120206547, now seen corresponding path program 1 times [2022-01-10 11:58:53,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:53,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204921111] [2022-01-10 11:58:53,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:53,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 11:58:53,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:53,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204921111] [2022-01-10 11:58:53,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204921111] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:58:53,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040578778] [2022-01-10 11:58:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:53,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:58:53,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:58:53,447 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:58:53,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 11:58:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:53,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 11:58:53,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:58:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 11:58:53,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:58:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 11:58:53,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040578778] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:58:53,910 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:58:53,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-01-10 11:58:53,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548866846] [2022-01-10 11:58:53,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:58:53,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 11:58:53,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:53,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 11:58:53,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 11:58:53,912 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:53,997 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-01-10 11:58:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 11:58:53,998 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 11:58:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:53,998 INFO L225 Difference]: With dead ends: 62 [2022-01-10 11:58:53,998 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 11:58:53,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-01-10 11:58:53,999 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 90 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:58:53,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 95 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:58:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 11:58:54,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2022-01-10 11:58:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-01-10 11:58:54,004 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 23 [2022-01-10 11:58:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:54,004 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-01-10 11:58:54,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-01-10 11:58:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 11:58:54,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:54,005 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:58:54,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-10 11:58:54,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 11:58:54,209 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:54,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:54,210 INFO L85 PathProgramCache]: Analyzing trace with hash 537074492, now seen corresponding path program 1 times [2022-01-10 11:58:54,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:54,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137958093] [2022-01-10 11:58:54,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:54,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:58:54,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:54,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137958093] [2022-01-10 11:58:54,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137958093] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:58:54,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402765060] [2022-01-10 11:58:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:54,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:58:54,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:58:54,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:58:54,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 11:58:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:55,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 83 conjunts are in the unsatisfiable core [2022-01-10 11:58:55,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:58:55,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:55,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2022-01-10 11:58:56,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:56,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2022-01-10 11:58:56,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:56,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:58:56,276 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-10 11:58:56,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 36 [2022-01-10 11:58:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:58:56,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:58:56,960 INFO L353 Elim1Store]: treesize reduction 14, result has 54.8 percent of original size [2022-01-10 11:58:56,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 476 treesize of output 388 [2022-01-10 11:58:56,981 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-01-10 11:58:56,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 452 treesize of output 402 [2022-01-10 11:58:57,200 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 50 treesize of output 42 [2022-01-10 11:58:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:58:57,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402765060] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:58:57,623 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:58:57,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 42 [2022-01-10 11:58:57,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175693604] [2022-01-10 11:58:57,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:58:57,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-10 11:58:57,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:57,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-10 11:58:57,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2022-01-10 11:58:57,625 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 42 states, 42 states have (on average 2.5) internal successors, (105), 42 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:59:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:59:01,898 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2022-01-10 11:59:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 11:59:01,899 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.5) internal successors, (105), 42 states have internal predecessors, (105), 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 37 [2022-01-10 11:59:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:59:01,899 INFO L225 Difference]: With dead ends: 78 [2022-01-10 11:59:01,900 INFO L226 Difference]: Without dead ends: 50 [2022-01-10 11:59:01,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=721, Invalid=3061, Unknown=0, NotChecked=0, Total=3782 [2022-01-10 11:59:01,901 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 310 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 11:59:01,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 193 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 11:59:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-10 11:59:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-01-10 11:59:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:59:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-01-10 11:59:01,908 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 37 [2022-01-10 11:59:01,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:59:01,908 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-01-10 11:59:01,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.5) internal successors, (105), 42 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:59:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-01-10 11:59:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 11:59:01,909 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:59:01,909 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:59:01,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 11:59:02,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:59:02,115 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:59:02,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:59:02,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1974317251, now seen corresponding path program 2 times [2022-01-10 11:59:02,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:59:02,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142055674] [2022-01-10 11:59:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:59:02,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:59:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:59:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 11:59:02,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:59:02,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142055674] [2022-01-10 11:59:02,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142055674] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:59:02,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736697243] [2022-01-10 11:59:02,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 11:59:02,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:59:02,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:59:02,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:59:02,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 11:59:03,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 11:59:03,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:59:03,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 127 conjunts are in the unsatisfiable core [2022-01-10 11:59:03,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:59:03,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 11:59:03,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:59:03,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:59:03,645 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 22 treesize of output 23 [2022-01-10 11:59:03,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:59:03,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:59:03,656 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 22 treesize of output 23 [2022-01-10 11:59:03,877 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:59:03,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 11:59:04,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:59:04,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-01-10 11:59:04,005 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 40 treesize of output 38 [2022-01-10 11:59:04,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:59:04,027 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-01-10 11:59:04,032 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 40 treesize of output 38 [2022-01-10 11:59:04,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:59:04,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:59:04,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:59:04,151 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 11:59:04,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 146 [2022-01-10 11:59:04,165 INFO L353 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2022-01-10 11:59:04,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 109 [2022-01-10 11:59:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 11:59:05,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:59:05,173 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.baseInt| v_ArrVal_408) |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-10 11:59:05,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_remove_last_~last~0#1.baseInt| v_ArrVal_408) |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-10 11:59:05,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_remove_last_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_remove_last_~head#1.offsetInt|) v_ArrVal_408) |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-10 11:59:05,225 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int))) (not (<= 0 (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_408) |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-10 11:59:06,427 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 Int) (v_ArrVal_400 Int) (v_ArrVal_408 (Array Int Int))) (let ((.cse10 (mod (+ 12 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) 18446744073709551616))) (let ((.cse3 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) .cse10 v_ArrVal_400)))) (let ((.cse8 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse5 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) .cse10 v_ArrVal_401)))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse9 (mod (+ 4 .cse8) 18446744073709551616))) (let ((.cse7 (select (select .cse3 .cse6) .cse9)) (.cse4 (select (select .cse5 .cse6) .cse9))) (let ((.cse2 (select .cse3 .cse4)) (.cse0 (select .cse5 .cse4)) (.cse1 (mod (+ .cse7 4) 18446744073709551616))) (or (and (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0)) (not (<= 0 (select (select (store (store .cse3 .cse4 (store .cse2 .cse1 0)) (select (select (store .cse5 .cse4 (store .cse0 .cse1 0)) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|) v_ArrVal_408) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| .cse6)) (not (<= 0 .cse7)) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| .cse8)))))))))) is different from false [2022-01-10 11:59:06,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:59:06,506 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:59:06,506 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 2091 treesize of output 1523 [2022-01-10 11:59:06,516 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:59:06,535 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:59:06,535 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 1531 treesize of output 991 [2022-01-10 11:59:07,766 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 Int) (v_ArrVal_400 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (let ((.cse12 (mod (+ 12 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) 18446744073709551616))) (let ((.cse3 (let ((.cse13 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| v_arrayElimArr_4))) (store .cse13 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (store (select .cse13 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) .cse12 v_ArrVal_400))))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse7 (let ((.cse11 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| v_arrayElimArr_3))) (store .cse11 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (store (select .cse11 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) .cse12 v_ArrVal_401))))) (let ((.cse2 (select (select .cse7 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse10 (mod (+ .cse0 4) 18446744073709551616))) (let ((.cse9 (select (select .cse3 .cse2) .cse10)) (.cse4 (select (select .cse7 .cse2) .cse10))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 4) 18446744073709551616)) (.cse5 (select .cse3 .cse4)) (.cse8 (select .cse7 .cse4)) (.cse6 (mod (+ .cse9 4) 18446744073709551616))) (or (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| .cse0)) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (select v_arrayElimArr_3 .cse1))) (not (= (select v_arrayElimArr_4 .cse1) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| .cse2)) (not (<= 0 (select (select (store (store .cse3 .cse4 (store .cse5 .cse6 0)) (select (select (store .cse7 .cse4 (store .cse8 .cse6 0)) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|) v_ArrVal_408) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (and (= (select .cse5 .cse6) 0) (= (select .cse8 .cse6) 0)) (not (<= 0 .cse9)))))))))) is different from false [2022-01-10 11:59:13,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:59:13,533 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:59:13,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2491 treesize of output 1717 [2022-01-10 11:59:13,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:59:13,566 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:59:13,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1935 treesize of output 1085