/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_NONE.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_prepend_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:38:24,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:38:24,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:38:24,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:38:24,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:38:24,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:38:24,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:38:24,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:38:24,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:38:24,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:38:24,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:38:24,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:38:24,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:38:24,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:38:24,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:38:24,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:38:24,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:38:24,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:38:24,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:38:24,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:38:24,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:38:24,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:38:24,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:38:24,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:38:24,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:38:24,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:38:24,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:38:24,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:38:24,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:38:24,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:38:24,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:38:24,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:38:24,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:38:24,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:38:24,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:38:24,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:38:24,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:38:24,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:38:24,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:38:24,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:38:24,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:38:24,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:38:24,576 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:38:24,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:38:24,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:38:24,577 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:38:24,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:38:24,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:38:24,578 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:38:24,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:38:24,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:38:24,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:38:24,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:38:24,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:38:24,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:38:24,580 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:38:24,580 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:38:24,580 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:38:24,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:38:24,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:38:24,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:38:24,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:38:24,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:38:24,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:38:24,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:38:24,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:38:24,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:38:24,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:38:24,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:38:24,582 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:38:24,583 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:38:24,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:38:24,583 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:38:24,583 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:38:24,584 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:38:24,584 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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 23:38:24,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:38:24,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:38:24,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:38:24,828 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:38:24,830 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:38:24,831 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_prepend_unequal.i [2022-01-10 23:38:24,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90954440e/73c5cdda49b84384a318933eb01aaf1e/FLAG5656eaabb [2022-01-10 23:38:25,367 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:38:25,367 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_unequal.i [2022-01-10 23:38:25,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90954440e/73c5cdda49b84384a318933eb01aaf1e/FLAG5656eaabb [2022-01-10 23:38:25,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90954440e/73c5cdda49b84384a318933eb01aaf1e [2022-01-10 23:38:25,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:38:25,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:38:25,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:38:25,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:38:25,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:38:25,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:38:25" (1/1) ... [2022-01-10 23:38:25,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ffe7245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:25, skipping insertion in model container [2022-01-10 23:38:25,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:38:25" (1/1) ... [2022-01-10 23:38:25,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:38:25,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:38:26,017 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_prepend_unequal.i[24450,24463] [2022-01-10 23:38:26,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:38:26,029 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:38:26,075 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_prepend_unequal.i[24450,24463] [2022-01-10 23:38:26,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:38:26,102 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:38:26,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:26 WrapperNode [2022-01-10 23:38:26,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:38:26,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:38:26,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:38:26,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:38:26,110 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:38:26" (1/1) ... [2022-01-10 23:38:26,129 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:38:26" (1/1) ... [2022-01-10 23:38:26,160 INFO L137 Inliner]: procedures = 130, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2022-01-10 23:38:26,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:38:26,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:38:26,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:38:26,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:38:26,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:26" (1/1) ... [2022-01-10 23:38:26,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:26" (1/1) ... [2022-01-10 23:38:26,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:26" (1/1) ... [2022-01-10 23:38:26,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:26" (1/1) ... [2022-01-10 23:38:26,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:26" (1/1) ... [2022-01-10 23:38:26,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:26" (1/1) ... [2022-01-10 23:38:26,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:26" (1/1) ... [2022-01-10 23:38:26,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:38:26,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:38:26,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:38:26,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:38:26,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:26" (1/1) ... [2022-01-10 23:38:26,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:38:26,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:26,244 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 23:38:26,246 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 23:38:26,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 23:38:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:38:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:38:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 23:38:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:38:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:38:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:38:26,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 23:38:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 23:38:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:38:26,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:38:26,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:38:26,423 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:38:26,425 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:38:26,808 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:38:26,814 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:38:26,814 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 23:38:26,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:38:26 BoogieIcfgContainer [2022-01-10 23:38:26,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:38:26,816 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:38:26,816 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:38:26,820 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:38:26,822 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:38:26" (1/1) ... [2022-01-10 23:38:26,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:38:26 BasicIcfg [2022-01-10 23:38:26,942 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:38:26,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:38:26,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:38:26,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:38:26,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:38:25" (1/4) ... [2022-01-10 23:38:26,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7b2bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:38:26, skipping insertion in model container [2022-01-10 23:38:26,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:38:26" (2/4) ... [2022-01-10 23:38:26,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7b2bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:38:26, skipping insertion in model container [2022-01-10 23:38:26,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:38:26" (3/4) ... [2022-01-10 23:38:26,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7b2bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:38:26, skipping insertion in model container [2022-01-10 23:38:26,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:38:26" (4/4) ... [2022-01-10 23:38:26,951 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.iTransformedIcfg [2022-01-10 23:38:26,955 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:38:26,956 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 23:38:27,011 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:38:27,018 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 23:38:27,018 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 23:38:27,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 27 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 23:38:27,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:27,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:27,037 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:27,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1664622863, now seen corresponding path program 1 times [2022-01-10 23:38:27,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:27,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812611336] [2022-01-10 23:38:27,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:27,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:27,267 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 23:38:27,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:27,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812611336] [2022-01-10 23:38:27,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812611336] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:38:27,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:38:27,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:38:27,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700266018] [2022-01-10 23:38:27,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:38:27,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:38:27,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:27,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:38:27,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:38:27,311 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 27 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 23:38:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:27,326 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-01-10 23:38:27,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:38:27,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-01-10 23:38:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:27,336 INFO L225 Difference]: With dead ends: 48 [2022-01-10 23:38:27,337 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 23:38:27,345 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 23:38:27,349 INFO L933 BasicCegarLoop]: 36 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, 36 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 23:38:27,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:38:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 23:38:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-10 23:38:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-01-10 23:38:27,376 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2022-01-10 23:38:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:27,377 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-01-10 23:38:27,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 23:38:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-01-10 23:38:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 23:38:27,379 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:27,379 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:27,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:38:27,381 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:27,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash -132328496, now seen corresponding path program 1 times [2022-01-10 23:38:27,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:27,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379367878] [2022-01-10 23:38:27,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:27,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:27,994 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 23:38:27,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:27,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379367878] [2022-01-10 23:38:27,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379367878] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:38:27,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:38:27,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 23:38:27,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894549447] [2022-01-10 23:38:27,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:38:27,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 23:38:27,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:27,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 23:38:27,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:38:27,997 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 23:38:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:28,366 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-01-10 23:38:28,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 23:38:28,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2022-01-10 23:38:28,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:28,368 INFO L225 Difference]: With dead ends: 59 [2022-01-10 23:38:28,368 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 23:38:28,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 23:38:28,370 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:28,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 84 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:38:28,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 23:38:28,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2022-01-10 23:38:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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 23:38:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-01-10 23:38:28,376 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 13 [2022-01-10 23:38:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:28,376 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-01-10 23:38:28,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 23:38:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-01-10 23:38:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 23:38:28,377 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:28,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:28,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:38:28,378 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:28,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:28,378 INFO L85 PathProgramCache]: Analyzing trace with hash -131404975, now seen corresponding path program 1 times [2022-01-10 23:38:28,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:28,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034168403] [2022-01-10 23:38:28,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:28,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:28,474 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 23:38:28,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:28,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034168403] [2022-01-10 23:38:28,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034168403] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:38:28,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:38:28,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:38:28,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119235932] [2022-01-10 23:38:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:38:28,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:38:28,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:28,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:38:28,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:38:28,477 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 23:38:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:28,488 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-01-10 23:38:28,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:38:28,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-01-10 23:38:28,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:28,489 INFO L225 Difference]: With dead ends: 40 [2022-01-10 23:38:28,490 INFO L226 Difference]: Without dead ends: 26 [2022-01-10 23:38:28,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:38:28,491 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:28,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:38:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-10 23:38:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-01-10 23:38:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 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 23:38:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-01-10 23:38:28,496 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 13 [2022-01-10 23:38:28,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:28,496 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-01-10 23:38:28,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 23:38:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-01-10 23:38:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 23:38:28,497 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:28,497 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 23:38:28,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:38:28,498 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:28,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:28,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1165178246, now seen corresponding path program 1 times [2022-01-10 23:38:28,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:28,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435848087] [2022-01-10 23:38:28,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:28,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:38:28,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:28,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435848087] [2022-01-10 23:38:28,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435848087] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:28,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069499206] [2022-01-10 23:38:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:28,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:28,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:28,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:38:28,683 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 23:38:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:28,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 66 conjunts are in the unsatisfiable core [2022-01-10 23:38:28,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:28,988 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 23:38:29,155 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 23:38:29,158 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 20 treesize of output 18 [2022-01-10 23:38:29,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:38:29,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:29,278 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 15 treesize of output 17 [2022-01-10 23:38:29,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:29,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 23:38:29,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:29,357 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 15 treesize of output 17 [2022-01-10 23:38:29,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-10 23:38:29,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 23:38:29,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:38:29,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:29,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 23:38:29,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:38:29,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-01-10 23:38:29,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-01-10 23:38:29,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 23:38:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:38:29,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 23:38:29,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069499206] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:38:29,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 23:38:29,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2022-01-10 23:38:29,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386257482] [2022-01-10 23:38:29,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:38:29,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 23:38:29,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 23:38:29,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-01-10 23:38:29,587 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 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 23:38:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:30,132 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-01-10 23:38:30,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 23:38:30,135 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 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 23:38:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:30,136 INFO L225 Difference]: With dead ends: 29 [2022-01-10 23:38:30,136 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 23:38:30,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2022-01-10 23:38:30,138 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:30,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 48 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:38:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 23:38:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-01-10 23:38:30,142 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 23:38:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-01-10 23:38:30,143 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2022-01-10 23:38:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:30,143 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-01-10 23:38:30,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 12 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 23:38:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-01-10 23:38:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 23:38:30,144 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:30,144 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] [2022-01-10 23:38:30,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 23:38:30,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:30,360 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:30,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1250132990, now seen corresponding path program 1 times [2022-01-10 23:38:30,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:30,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320122314] [2022-01-10 23:38:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:30,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:38:30,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:30,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320122314] [2022-01-10 23:38:30,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320122314] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:30,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153570053] [2022-01-10 23:38:30,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:30,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:30,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:30,513 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 23:38:30,514 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 23:38:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:30,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-10 23:38:30,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:30,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 23:38:30,864 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 23:38:30,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-01-10 23:38:30,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:30,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 23:38:30,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:30,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-01-10 23:38:31,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:31,052 INFO L353 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-01-10 23:38:31,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 56 [2022-01-10 23:38:31,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-01-10 23:38:31,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:31,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 34 [2022-01-10 23:38:31,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:38:31,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-01-10 23:38:31,245 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-10 23:38:31,246 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 61 treesize of output 20 [2022-01-10 23:38:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:38:31,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 23:38:31,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153570053] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:38:31,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 23:38:31,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2022-01-10 23:38:31,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797451587] [2022-01-10 23:38:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:38:31,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 23:38:31,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:31,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 23:38:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-01-10 23:38:31,276 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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 23:38:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:31,841 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-01-10 23:38:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 23:38:31,841 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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 20 [2022-01-10 23:38:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:31,842 INFO L225 Difference]: With dead ends: 50 [2022-01-10 23:38:31,842 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 23:38:31,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2022-01-10 23:38:31,843 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:31,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 69 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 131 Invalid, 0 Unknown, 22 Unchecked, 0.2s Time] [2022-01-10 23:38:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 23:38:31,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-01-10 23:38:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 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 23:38:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-01-10 23:38:31,848 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2022-01-10 23:38:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:31,848 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-01-10 23:38:31,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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 23:38:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-01-10 23:38:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 23:38:31,849 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:31,849 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] [2022-01-10 23:38:31,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 23:38:32,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:32,050 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:32,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:32,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1250131967, now seen corresponding path program 1 times [2022-01-10 23:38:32,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:32,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86768561] [2022-01-10 23:38:32,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:32,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:38:32,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:32,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86768561] [2022-01-10 23:38:32,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86768561] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:32,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138311285] [2022-01-10 23:38:32,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:32,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:32,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:32,135 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 23:38:32,169 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 23:38:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:32,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 89 conjunts are in the unsatisfiable core [2022-01-10 23:38:32,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:32,385 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 23:38:32,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:32,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:32,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:32,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-01-10 23:38:32,649 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 23:38:32,650 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 20 treesize of output 18 [2022-01-10 23:38:32,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:32,765 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 39 treesize of output 37 [2022-01-10 23:38:32,770 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 22 treesize of output 24 [2022-01-10 23:38:32,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:32,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-01-10 23:38:32,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:32,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2022-01-10 23:38:32,879 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 22 treesize of output 24 [2022-01-10 23:38:32,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:32,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2022-01-10 23:38:32,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:33,001 INFO L353 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-01-10 23:38:33,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 89 [2022-01-10 23:38:33,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:33,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-01-10 23:38:33,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:33,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:33,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2022-01-10 23:38:33,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:33,079 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2022-01-10 23:38:33,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:33,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-10 23:38:33,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:33,092 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2022-01-10 23:38:33,273 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-01-10 23:38:33,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 85 [2022-01-10 23:38:33,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:33,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 24 [2022-01-10 23:38:33,327 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 23:38:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:38:33,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:33,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_467 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (let ((.cse3 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt|))) (.cse0 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.baseInt|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse2 (mod (+ (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|) 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| v_ArrVal_467) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-01-10 23:38:33,530 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_462 Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_467 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offsetInt| .cse0 v_ArrVal_461))) (store .cse6 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt|)))) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_460))) (store .cse5 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.baseInt|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse3 (mod (+ (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|) 4) 18446744073709551616))) (select (select (store (store |c_#memory_intInt| .cse0 (store (select |c_#memory_intInt| .cse0) (mod (+ (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|) 12) 18446744073709551616) v_ArrVal_462)) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| v_ArrVal_467) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-01-10 23:38:33,597 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_462 Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1| Int) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_467 (Array Int Int))) (let ((.cse11 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1| 4) 18446744073709551616))) (let ((.cse10 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) .cse11 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))) (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (let ((.cse8 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) .cse11 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))))) (let ((.cse1 (select (select .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))) (let ((.cse6 (let ((.cse9 (store .cse10 .cse1 v_ArrVal_461))) (store .cse9 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse9 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_460))) (store .cse7 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse7 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse5 (mod (+ (select (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|) 4) 18446744073709551616))) (select (select (store (let ((.cse0 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_456))) (store .cse0 .cse1 (store (select .cse0 .cse1) (mod (+ 12 .cse2) 18446744073709551616) v_ArrVal_462))) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| v_ArrVal_467) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))) (not (<= 0 .cse2))))))) is different from false [2022-01-10 23:38:33,737 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_462 Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1| Int) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_467 (Array Int Int))) (let ((.cse11 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1| 4) 18446744073709551616))) (let ((.cse10 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| (store v_ArrVal_453 .cse11 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_453) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))) (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (let ((.cse8 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| (store v_ArrVal_451 .cse11 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_451) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))))) (let ((.cse1 (select (select .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))) (let ((.cse6 (let ((.cse9 (store .cse10 .cse1 v_ArrVal_461))) (store .cse9 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse9 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_460))) (store .cse7 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse7 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse5 (mod (+ (select (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|) 4) 18446744073709551616))) (select (select (store (let ((.cse0 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_456))) (store .cse0 .cse1 (store (select .cse0 .cse1) (mod (+ .cse2 12) 18446744073709551616) v_ArrVal_462))) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| v_ArrVal_467) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))) (not (<= 0 .cse2))))))) is different from false [2022-01-10 23:38:33,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18454 treesize of output 17664 [2022-01-10 23:38:33,907 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:33,908 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 20400 treesize of output 19470 [2022-01-10 23:38:34,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1806136 treesize of output 1761218 [2022-01-10 23:38:37,060 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:37,065 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 1963518 treesize of output 1903124 [2022-01-10 23:38:40,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2183330 treesize of output 2062462 [2022-01-10 23:38:43,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2518592 treesize of output 2465276 [2022-01-10 23:38:47,053 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 2939910 treesize of output 2818086 [2022-01-10 23:38:51,089 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 3201302 treesize of output 3079430 [2022-01-10 23:39:29,491 WARN L228 SmtUtils]: Spent 24.78s on a formula simplification. DAG size of input: 4959 DAG size of output: 4959 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)