/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/dll2c_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:37:47,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:37:47,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:37:47,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:37:47,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:37:47,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:37:47,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:37:47,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:37:47,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:37:47,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:37:47,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:37:47,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:37:47,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:37:47,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:37:47,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:37:47,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:37:47,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:37:47,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:37:47,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:37:47,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:37:47,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:37:47,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:37:47,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:37:47,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:37:47,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:37:47,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:37:47,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:37:47,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:37:47,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:37:47,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:37:47,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:37:47,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:37:47,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:37:47,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:37:47,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:37:47,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:37:47,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:37:47,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:37:47,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:37:47,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:37:47,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:37:47,324 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:37:47,353 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:37:47,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:37:47,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:37:47,354 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:37:47,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:37:47,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:37:47,355 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:37:47,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:37:47,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:37:47,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:37:47,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:37:47,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:37:47,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:37:47,356 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:37:47,356 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:37:47,356 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:37:47,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:37:47,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:37:47,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:37:47,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:37:47,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:37:47,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:37:47,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:37:47,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:37:47,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:37:47,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:37:47,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:37:47,358 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:37:47,358 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:37:47,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:37:47,358 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:37:47,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:37:47,360 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:37:47,360 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:37:47,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:37:47,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:37:47,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:37:47,572 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:37:47,573 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:37:47,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i [2022-01-10 23:37:47,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbadceff0/6a2b2b6f2d364041bcc52a86630bc9ed/FLAG9b95e26e3 [2022-01-10 23:37:48,034 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:37:48,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i [2022-01-10 23:37:48,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbadceff0/6a2b2b6f2d364041bcc52a86630bc9ed/FLAG9b95e26e3 [2022-01-10 23:37:48,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbadceff0/6a2b2b6f2d364041bcc52a86630bc9ed [2022-01-10 23:37:48,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:37:48,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:37:48,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:37:48,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:37:48,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:37:48,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:37:48" (1/1) ... [2022-01-10 23:37:48,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1913d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:48, skipping insertion in model container [2022-01-10 23:37:48,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:37:48" (1/1) ... [2022-01-10 23:37:48,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:37:48,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:37:48,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i[24538,24551] [2022-01-10 23:37:48,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:37:48,649 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:37:48,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i[24538,24551] [2022-01-10 23:37:48,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:37:48,691 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:37:48,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:48 WrapperNode [2022-01-10 23:37:48,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:37:48,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:37:48,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:37:48,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:37:48,697 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:37:48" (1/1) ... [2022-01-10 23:37:48,706 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:37:48" (1/1) ... [2022-01-10 23:37:48,721 INFO L137 Inliner]: procedures = 129, calls = 29, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 145 [2022-01-10 23:37:48,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:37:48,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:37:48,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:37:48,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:37:48,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:48" (1/1) ... [2022-01-10 23:37:48,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:48" (1/1) ... [2022-01-10 23:37:48,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:48" (1/1) ... [2022-01-10 23:37:48,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:48" (1/1) ... [2022-01-10 23:37:48,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:48" (1/1) ... [2022-01-10 23:37:48,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:48" (1/1) ... [2022-01-10 23:37:48,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:48" (1/1) ... [2022-01-10 23:37:48,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:37:48,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:37:48,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:37:48,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:37:48,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:48" (1/1) ... [2022-01-10 23:37:48,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:37:48,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:37:48,788 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:37:48,821 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:37:48,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 23:37:48,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:37:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:37:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:37:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:37:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:37:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 23:37:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:37:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:37:48,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:37:48,911 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:37:48,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:37:49,163 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:37:49,167 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:37:49,168 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 23:37:49,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:37:49 BoogieIcfgContainer [2022-01-10 23:37:49,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:37:49,169 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:37:49,169 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:37:49,170 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:37:49,181 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:37:49" (1/1) ... [2022-01-10 23:37:49,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:37:49 BasicIcfg [2022-01-10 23:37:49,276 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:37:49,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:37:49,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:37:49,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:37:49,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:37:48" (1/4) ... [2022-01-10 23:37:49,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b572dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:37:49, skipping insertion in model container [2022-01-10 23:37:49,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:48" (2/4) ... [2022-01-10 23:37:49,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b572dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:37:49, skipping insertion in model container [2022-01-10 23:37:49,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:37:49" (3/4) ... [2022-01-10 23:37:49,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b572dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:37:49, skipping insertion in model container [2022-01-10 23:37:49,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:37:49" (4/4) ... [2022-01-10 23:37:49,284 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.iTransformedIcfg [2022-01-10 23:37:49,291 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:37:49,291 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 23:37:49,337 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:37:49,344 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:37:49,345 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 23:37:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 23:37:49,360 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:49,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:49,361 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:49,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash -327494694, now seen corresponding path program 1 times [2022-01-10 23:37:49,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:49,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110221931] [2022-01-10 23:37:49,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:49,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:49,580 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:37:49,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:49,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110221931] [2022-01-10 23:37:49,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110221931] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:37:49,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:37:49,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:37:49,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98779092] [2022-01-10 23:37:49,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:49,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:37:49,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:49,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:37:49,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:37:49,611 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:49,625 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-01-10 23:37:49,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:37:49,628 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 23:37:49,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:49,633 INFO L225 Difference]: With dead ends: 61 [2022-01-10 23:37:49,633 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 23:37:49,636 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:37:49,641 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:49,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:37:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 23:37:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-10 23:37:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-01-10 23:37:49,666 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2022-01-10 23:37:49,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:49,666 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-01-10 23:37:49,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-01-10 23:37:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 23:37:49,669 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:49,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:49,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:37:49,670 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:49,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:49,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1416239162, now seen corresponding path program 1 times [2022-01-10 23:37:49,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:49,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684661745] [2022-01-10 23:37:49,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:49,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:49,805 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:37:49,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:49,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684661745] [2022-01-10 23:37:49,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684661745] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:37:49,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:37:49,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:37:49,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774305454] [2022-01-10 23:37:49,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:49,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:37:49,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:49,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:37:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:37:49,808 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:49,832 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-01-10 23:37:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:37:49,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 23:37:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:49,833 INFO L225 Difference]: With dead ends: 44 [2022-01-10 23:37:49,833 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 23:37:49,833 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:37:49,834 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:49,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:37:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 23:37:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 23:37:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-01-10 23:37:49,840 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 16 [2022-01-10 23:37:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:49,843 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-01-10 23:37:49,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-01-10 23:37:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 23:37:49,844 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:49,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:49,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:37:49,844 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:49,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:49,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1321570061, now seen corresponding path program 1 times [2022-01-10 23:37:49,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:49,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490319493] [2022-01-10 23:37:49,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:49,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:50,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490319493] [2022-01-10 23:37:50,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490319493] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:37:50,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:37:50,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 23:37:50,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628496949] [2022-01-10 23:37:50,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:50,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 23:37:50,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:50,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 23:37:50,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:37:50,008 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:50,059 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-01-10 23:37:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 23:37:50,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 23:37:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:50,060 INFO L225 Difference]: With dead ends: 50 [2022-01-10 23:37:50,060 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 23:37:50,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:37:50,061 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:50,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 102 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:37:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 23:37:50,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-01-10 23:37:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-01-10 23:37:50,079 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 22 [2022-01-10 23:37:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:50,080 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-01-10 23:37:50,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-01-10 23:37:50,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 23:37:50,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:50,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:50,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:37:50,081 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:50,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1439046502, now seen corresponding path program 1 times [2022-01-10 23:37:50,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:50,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574948319] [2022-01-10 23:37:50,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:50,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:50,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:50,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574948319] [2022-01-10 23:37:50,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574948319] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:37:50,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784226174] [2022-01-10 23:37:50,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:50,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:37:50,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:37:50,324 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:37:50,336 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:37:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:50,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 23:37:50,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:37:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:37:50,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:37:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:37:50,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784226174] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:37:50,918 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:37:50,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-01-10 23:37:50,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412776923] [2022-01-10 23:37:50,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:37:50,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 23:37:50,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:50,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 23:37:50,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-01-10 23:37:50,923 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:51,018 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-01-10 23:37:51,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 23:37:51,018 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 23:37:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:51,020 INFO L225 Difference]: With dead ends: 68 [2022-01-10 23:37:51,020 INFO L226 Difference]: Without dead ends: 59 [2022-01-10 23:37:51,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-01-10 23:37:51,026 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 88 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:51,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 145 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:37:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-10 23:37:51,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2022-01-10 23:37:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-01-10 23:37:51,039 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 27 [2022-01-10 23:37:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:51,040 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-01-10 23:37:51,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-01-10 23:37:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 23:37:51,041 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:51,041 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:51,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 23:37:51,261 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:37:51,262 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:51,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:51,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1406009133, now seen corresponding path program 2 times [2022-01-10 23:37:51,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:51,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674745448] [2022-01-10 23:37:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:51,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:51,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:51,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674745448] [2022-01-10 23:37:51,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674745448] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:37:51,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899759442] [2022-01-10 23:37:51,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 23:37:51,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:37:51,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:37:51,426 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:37:51,427 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:37:52,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 23:37:52,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:37:52,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 23:37:52,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:37:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:52,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:37:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:52,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899759442] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:37:52,942 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:37:52,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-01-10 23:37:52,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407390949] [2022-01-10 23:37:52,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:37:52,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 23:37:52,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:52,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 23:37:52,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 23:37:52,943 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:53,125 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2022-01-10 23:37:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 23:37:53,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-10 23:37:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:53,126 INFO L225 Difference]: With dead ends: 73 [2022-01-10 23:37:53,126 INFO L226 Difference]: Without dead ends: 59 [2022-01-10 23:37:53,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-01-10 23:37:53,127 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 93 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:53,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 128 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:37:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-10 23:37:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2022-01-10 23:37:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-01-10 23:37:53,133 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 32 [2022-01-10 23:37:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:53,133 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-01-10 23:37:53,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-01-10 23:37:53,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 23:37:53,134 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:53,134 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:53,141 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:37:53,339 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:37:53,340 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:53,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1716659722, now seen corresponding path program 1 times [2022-01-10 23:37:53,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:53,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417399077] [2022-01-10 23:37:53,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:53,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:37:54,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:54,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417399077] [2022-01-10 23:37:54,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417399077] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:37:54,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069878729] [2022-01-10 23:37:54,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:54,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:37:54,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:37:54,444 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:37:54,445 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:37:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:54,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 94 conjunts are in the unsatisfiable core [2022-01-10 23:37:54,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:37:54,687 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:37:54,748 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:37:54,749 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 23:37:54,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:37:54,835 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:37:54,900 INFO L353 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-01-10 23:37:54,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 71 [2022-01-10 23:37:54,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57 [2022-01-10 23:37:54,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-10 23:37:54,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-10 23:37:54,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-10 23:37:55,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-01-10 23:37:55,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:55,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:55,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2022-01-10 23:37:55,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2022-01-10 23:37:55,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-10 23:37:55,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:37:55,577 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:37:55,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-01-10 23:37:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:37:55,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:37:55,889 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616)) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (forall ((v_ArrVal_557 (Array Int Int))) (<= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616))))) is different from false [2022-01-10 23:37:55,913 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616)) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (forall ((v_ArrVal_557 (Array Int Int))) (<= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616))))) is different from false [2022-01-10 23:37:55,923 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616)) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (forall ((v_ArrVal_557 (Array Int Int))) (<= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616))))) is different from false [2022-01-10 23:37:55,947 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:37:55,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-01-10 23:37:55,955 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:37:55,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 81 [2022-01-10 23:37:55,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2022-01-10 23:37:56,031 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:37:56,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-01-10 23:37:56,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 62 [2022-01-10 23:37:56,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2022-01-10 23:37:56,375 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_556 Int)) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| (select (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_556) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)))) is different from false [2022-01-10 23:37:56,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_556 Int)) (not (= (select (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_556) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|))) is different from false [2022-01-10 23:37:56,398 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_556 Int)) (not (= (select (store (store (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_548) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_556) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|))) is different from false [2022-01-10 23:37:56,406 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:37:56,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-01-10 23:37:56,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 117 [2022-01-10 23:37:56,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:37:56,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:37:56,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2022-01-10 23:37:56,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 133 [2022-01-10 23:37:56,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 70 [2022-01-10 23:37:56,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-10 23:37:56,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069878729] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:37:56,616 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:37:56,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 49 [2022-01-10 23:37:56,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161886565] [2022-01-10 23:37:56,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:37:56,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-01-10 23:37:56,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:56,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-01-10 23:37:56,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1685, Unknown=6, NotChecked=522, Total=2352 [2022-01-10 23:37:56,618 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 49 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:58,484 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2022-01-10 23:37:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-10 23:37:58,484 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 49 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-10 23:37:58,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:58,486 INFO L225 Difference]: With dead ends: 91 [2022-01-10 23:37:58,486 INFO L226 Difference]: Without dead ends: 89 [2022-01-10 23:37:58,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=412, Invalid=3638, Unknown=6, NotChecked=774, Total=4830 [2022-01-10 23:37:58,488 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 153 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:58,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 445 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 659 Invalid, 0 Unknown, 461 Unchecked, 0.6s Time] [2022-01-10 23:37:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-10 23:37:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-01-10 23:37:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-01-10 23:37:58,499 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 33 [2022-01-10 23:37:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:58,499 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-01-10 23:37:58,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 49 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-01-10 23:37:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 23:37:58,499 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:58,500 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:58,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 23:37:58,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:37:58,717 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:58,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:58,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1649652969, now seen corresponding path program 1 times [2022-01-10 23:37:58,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:58,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639667745] [2022-01-10 23:37:58,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:58,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 23:37:58,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:58,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639667745] [2022-01-10 23:37:58,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639667745] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:37:58,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:37:58,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:37:58,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215026941] [2022-01-10 23:37:58,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:58,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:37:58,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:58,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:37:58,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:37:58,793 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:58,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:58,845 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2022-01-10 23:37:58,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:37:58,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-10 23:37:58,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:58,846 INFO L225 Difference]: With dead ends: 90 [2022-01-10 23:37:58,846 INFO L226 Difference]: Without dead ends: 61 [2022-01-10 23:37:58,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 23:37:58,847 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 62 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:58,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 48 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:37:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-10 23:37:58,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-01-10 23:37:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-01-10 23:37:58,881 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 33 [2022-01-10 23:37:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:58,881 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-01-10 23:37:58,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-01-10 23:37:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 23:37:58,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:58,882 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:58,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 23:37:58,882 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:58,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:58,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1700673840, now seen corresponding path program 1 times [2022-01-10 23:37:58,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:58,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768954422] [2022-01-10 23:37:58,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:58,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 23:37:58,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:58,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768954422] [2022-01-10 23:37:58,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768954422] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:37:58,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:37:58,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:37:58,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946545728] [2022-01-10 23:37:58,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:58,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 23:37:58,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:58,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 23:37:58,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 23:37:58,943 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:58,973 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-01-10 23:37:58,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:37:58,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-10 23:37:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:58,974 INFO L225 Difference]: With dead ends: 78 [2022-01-10 23:37:58,974 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 23:37:58,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:37:58,975 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:58,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 79 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:37:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 23:37:58,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-01-10 23:37:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2022-01-10 23:37:58,985 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 34 [2022-01-10 23:37:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:58,985 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2022-01-10 23:37:58,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-01-10 23:37:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 23:37:58,986 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:58,986 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:58,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 23:37:58,986 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:58,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:58,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1538073907, now seen corresponding path program 2 times [2022-01-10 23:37:58,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:58,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279863410] [2022-01-10 23:37:58,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:58,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:59,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:59,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279863410] [2022-01-10 23:37:59,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279863410] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:37:59,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8082335] [2022-01-10 23:37:59,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 23:37:59,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:37:59,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:37:59,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:37:59,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 23:37:59,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 23:37:59,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:37:59,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-10 23:37:59,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:37:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:59,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:38:30,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8082335] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:38:30,081 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:38:30,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 17 [2022-01-10 23:38:30,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603844800] [2022-01-10 23:38:30,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:38:30,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 23:38:30,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:30,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 23:38:30,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=204, Unknown=3, NotChecked=0, Total=272 [2022-01-10 23:38:30,082 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:30,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:30,384 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2022-01-10 23:38:30,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 23:38:30,385 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-10 23:38:30,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:30,387 INFO L225 Difference]: With dead ends: 100 [2022-01-10 23:38:30,387 INFO L226 Difference]: Without dead ends: 78 [2022-01-10 23:38:30,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=162, Invalid=387, Unknown=3, NotChecked=0, Total=552 [2022-01-10 23:38:30,389 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 165 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:30,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 197 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 70 Invalid, 0 Unknown, 4 Unchecked, 0.1s Time] [2022-01-10 23:38:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-10 23:38:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2022-01-10 23:38:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-01-10 23:38:30,408 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 34 [2022-01-10 23:38:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:30,408 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-01-10 23:38:30,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-01-10 23:38:30,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 23:38:30,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:30,412 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:30,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 23:38:30,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:30,618 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:30,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:30,619 INFO L85 PathProgramCache]: Analyzing trace with hash 298039065, now seen corresponding path program 1 times [2022-01-10 23:38:30,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:30,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786419632] [2022-01-10 23:38:30,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:30,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 23:38:30,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:30,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786419632] [2022-01-10 23:38:30,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786419632] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:30,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813894009] [2022-01-10 23:38:30,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:30,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:30,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:30,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:38:30,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 23:38:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:30,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 23:38:30,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:38:31,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 23:38:31,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813894009] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:38:31,242 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:38:31,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 10 [2022-01-10 23:38:31,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847215778] [2022-01-10 23:38:31,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:38:31,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 23:38:31,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:31,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 23:38:31,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-10 23:38:31,243 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:31,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:31,454 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2022-01-10 23:38:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 23:38:31,454 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-01-10 23:38:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:31,456 INFO L225 Difference]: With dead ends: 95 [2022-01-10 23:38:31,456 INFO L226 Difference]: Without dead ends: 87 [2022-01-10 23:38:31,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-01-10 23:38:31,457 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:31,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 203 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:38:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-10 23:38:31,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2022-01-10 23:38:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-01-10 23:38:31,471 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 39 [2022-01-10 23:38:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:31,471 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-01-10 23:38:31,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-01-10 23:38:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 23:38:31,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:31,472 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:31,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-10 23:38:31,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-10 23:38:31,687 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:31,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:31,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1244631930, now seen corresponding path program 3 times [2022-01-10 23:38:31,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:31,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388050078] [2022-01-10 23:38:31,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:31,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:38:31,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:31,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388050078] [2022-01-10 23:38:31,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388050078] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:31,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002631451] [2022-01-10 23:38:31,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 23:38:31,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:31,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:31,822 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:38:31,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 23:38:35,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-10 23:38:35,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:38:35,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-10 23:38:35,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:38:35,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:38:36,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002631451] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:38:36,405 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:38:36,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 19 [2022-01-10 23:38:36,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995314382] [2022-01-10 23:38:36,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:38:36,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 23:38:36,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:36,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 23:38:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-01-10 23:38:36,406 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:36,535 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-01-10 23:38:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 23:38:36,535 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-01-10 23:38:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:36,536 INFO L225 Difference]: With dead ends: 89 [2022-01-10 23:38:36,536 INFO L226 Difference]: Without dead ends: 69 [2022-01-10 23:38:36,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-01-10 23:38:36,536 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 121 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:36,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 241 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:38:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-10 23:38:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-01-10 23:38:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-01-10 23:38:36,548 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 39 [2022-01-10 23:38:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:36,548 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-01-10 23:38:36,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-01-10 23:38:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 23:38:36,550 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:36,550 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:36,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 23:38:36,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:36,752 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:36,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:36,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1338953623, now seen corresponding path program 4 times [2022-01-10 23:38:36,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:36,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435253916] [2022-01-10 23:38:36,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:36,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 23:38:36,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:36,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435253916] [2022-01-10 23:38:36,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435253916] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:36,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868075139] [2022-01-10 23:38:36,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 23:38:36,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:36,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:36,829 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:38:36,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 23:38:37,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 23:38:37,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:38:37,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 23:38:37,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 23:38:37,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 23:38:37,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868075139] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:38:37,398 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:38:37,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-10 23:38:37,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165077510] [2022-01-10 23:38:37,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:38:37,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 23:38:37,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:37,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 23:38:37,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:38:37,399 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:37,414 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-01-10 23:38:37,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 23:38:37,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-01-10 23:38:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:37,415 INFO L225 Difference]: With dead ends: 76 [2022-01-10 23:38:37,415 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 23:38:37,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:38:37,416 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:37,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 64 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:38:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 23:38:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-01-10 23:38:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-01-10 23:38:37,439 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-01-10 23:38:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:37,439 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-01-10 23:38:37,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-01-10 23:38:37,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 23:38:37,440 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:37,440 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:37,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 23:38:37,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:37,659 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:37,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:37,660 INFO L85 PathProgramCache]: Analyzing trace with hash 673106433, now seen corresponding path program 1 times [2022-01-10 23:38:37,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:37,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565275195] [2022-01-10 23:38:37,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:37,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:38:38,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:38,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565275195] [2022-01-10 23:38:38,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565275195] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:38,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087974681] [2022-01-10 23:38:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:38,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:38,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:38,672 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:38:38,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 23:38:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:38,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 119 conjunts are in the unsatisfiable core [2022-01-10 23:38:38,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:38,910 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:39,000 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:38:39,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 23:38:39,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:38:39,126 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:38:39,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2022-01-10 23:38:39,232 INFO L353 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-01-10 23:38:39,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 62 [2022-01-10 23:38:39,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-01-10 23:38:39,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-10 23:38:39,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-10 23:38:39,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-10 23:38:39,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:39,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:39,424 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:39,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2022-01-10 23:38:39,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:38:39,668 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:38:39,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2022-01-10 23:38:39,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-01-10 23:38:39,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:39,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-01-10 23:38:40,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2022-01-10 23:38:40,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-01-10 23:38:40,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2022-01-10 23:38:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:38:40,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:40,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 100 [2022-01-10 23:38:40,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 100 [2022-01-10 23:38:40,817 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (forall ((v_ArrVal_1498 (Array Int Int))) (= (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1498) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ 16 .cse0) 18446744073709551616)) 16 .cse0)) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616))) (<= .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) (forall ((v_ArrVal_1499 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (<= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| .cse1))) is different from false [2022-01-10 23:38:40,844 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (forall ((v_ArrVal_1499 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (forall ((v_ArrVal_1498 (Array Int Int))) (= (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) v_ArrVal_1498) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ .cse1 16 (* (- 18446744073709551616) (div (+ .cse1 16) 18446744073709551616)))) (mod (+ 16 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|)) 18446744073709551616))) (<= .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) (<= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| .cse2))) is different from false [2022-01-10 23:38:40,858 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967296))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_1499 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse2 (select (select (store |c_#memory_$Pointer$.baseInt| .cse2 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (forall ((v_ArrVal_1498 (Array Int Int))) (= (mod (+ (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 16) 18446744073709551616) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) v_ArrVal_1498) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ 16 .cse3) 18446744073709551616)) 16 .cse3)))) (<= .cse1 .cse0))) is different from false [2022-01-10 23:38:40,873 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (forall ((v_ArrVal_1499 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (forall ((v_ArrVal_1498 (Array Int Int))) (= (mod (+ (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 16) 18446744073709551616) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) v_ArrVal_1498) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ 16 .cse1) 18446744073709551616)) 16 .cse1)))) (<= .cse2 .cse3) (<= .cse3 .cse2))) is different from false [2022-01-10 23:38:40,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 294 [2022-01-10 23:38:40,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 278 [2022-01-10 23:38:40,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-01-10 23:38:41,248 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296)) (.cse2 (forall ((v_ArrVal_1494 Int)) (not (= (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616) v_ArrVal_1494)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) .cse2 (or (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) .cse2) (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616) v_ArrVal_1494)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse3 (select (select (store .cse4 .cse3 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))))))) is different from false [2022-01-10 23:38:41,264 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((v_ArrVal_1494 Int)) (not (= (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616) v_ArrVal_1494)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616) v_ArrVal_1494)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse2 (select (select (store .cse3 .cse2 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))))))) is different from false [2022-01-10 23:38:41,279 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| .cse1) .cse0 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))))) (<= .cse2 .cse3) (<= .cse3 .cse2) (forall ((v_ArrVal_1494 Int)) (not (= (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))))) is different from false [2022-01-10 23:38:41,291 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt| .cse0) .cse1 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) .cse1)))) (forall ((v_ArrVal_1494 Int)) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt| (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|))))) is different from false [2022-01-10 23:38:41,308 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (let ((.cse0 (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1491) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_1494))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|))) (= (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1492) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| .cse0) .cse1 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) .cse1)))) (forall ((v_ArrVal_1494 Int) (v_ArrVal_1491 (Array Int Int))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| (select (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1491) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_1494) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|))))) is different from false [2022-01-10 23:38:41,328 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (let ((.cse1 (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1491) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))) (= .cse0 (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1492) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse1) .cse0 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))))) (forall ((v_ArrVal_1494 Int) (v_ArrVal_1491 (Array Int Int))) (not (= (select (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1491) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|)))) is different from false [2022-01-10 23:38:41,341 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1494 Int) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| (select (store (store (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_1488) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1491) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)))) (forall ((v_ArrVal_1494 Int) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_1488))) (let ((.cse1 (store (store (select (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1491) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1492) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse1) .cse2 v_ArrVal_1499) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) .cse2)))))) is different from false [2022-01-10 23:38:41,350 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:41,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-01-10 23:38:41,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 237 [2022-01-10 23:38:41,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 341 treesize of output 335 [2022-01-10 23:38:41,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 158 [2022-01-10 23:38:41,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 158 [2022-01-10 23:38:41,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 70 [2022-01-10 23:38:41,415 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 23:38:41,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 1 [2022-01-10 23:38:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-01-10 23:38:41,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087974681] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:38:41,654 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:38:41,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 25] total 62 [2022-01-10 23:38:41,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681427422] [2022-01-10 23:38:41,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:38:41,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-01-10 23:38:41,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:41,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-01-10 23:38:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2430, Unknown=11, NotChecked=1188, Total=3782 [2022-01-10 23:38:41,656 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 62 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:44,065 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-01-10 23:38:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 23:38:44,065 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-01-10 23:38:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:44,065 INFO L225 Difference]: With dead ends: 47 [2022-01-10 23:38:44,066 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 23:38:44,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 79 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=363, Invalid=4500, Unknown=11, NotChecked=1606, Total=6480 [2022-01-10 23:38:44,067 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 121 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:44,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 415 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 769 Invalid, 0 Unknown, 389 Unchecked, 0.7s Time] [2022-01-10 23:38:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 23:38:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-01-10 23:38:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-01-10 23:38:44,076 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-01-10 23:38:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:44,077 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-01-10 23:38:44,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-01-10 23:38:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 23:38:44,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:44,077 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:44,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 23:38:44,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-10 23:38:44,278 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash -584707047, now seen corresponding path program 2 times [2022-01-10 23:38:44,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:44,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501808250] [2022-01-10 23:38:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:44,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 23:38:44,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:44,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501808250] [2022-01-10 23:38:44,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501808250] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:44,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132036540] [2022-01-10 23:38:44,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 23:38:44,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:44,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:44,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:38:44,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 23:38:45,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 23:38:45,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:38:45,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-10 23:38:45,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:38:45,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 23:38:46,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132036540] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:38:46,147 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:38:46,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 16 [2022-01-10 23:38:46,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580381998] [2022-01-10 23:38:46,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:38:46,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 23:38:46,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:46,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 23:38:46,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-10 23:38:46,148 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:46,240 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-01-10 23:38:46,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 23:38:46,241 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-01-10 23:38:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:46,241 INFO L225 Difference]: With dead ends: 42 [2022-01-10 23:38:46,241 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 23:38:46,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-01-10 23:38:46,242 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:46,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 172 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 58 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-01-10 23:38:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 23:38:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 23:38:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 23:38:46,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-01-10 23:38:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:46,243 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 23:38:46,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:38:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 23:38:46,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 23:38:46,245 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 23:38:46,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-10 23:38:46,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-10 23:38:46,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 23:38:49,901 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 23:38:49,902 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 23:38:49,902 INFO L858 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-01-10 23:38:49,902 INFO L861 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-01-10 23:38:49,902 INFO L858 garLoopResultBuilder]: For program point L577-1(lines 577 579) no Hoare annotation was computed. [2022-01-10 23:38:49,902 INFO L854 garLoopResultBuilder]: At program point L583(lines 575 584) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) 1) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) 1) (<= 1 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 2) (<= 2 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0) (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (< 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) [2022-01-10 23:38:49,902 INFO L854 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0)) (.cse2 (<= 1 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|)) (.cse3 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse5 (< 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|))) (or (let ((.cse0 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 1) 4294967296)) (.cse4 (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| 1))) (and (<= .cse0 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|) (<= 2 .cse0) .cse1 (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0) 0) .cse2 .cse3 (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) 0) (or (<= (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (<= .cse4 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|)) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0)) (or (<= .cse4 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (<= (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|)) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 0) .cse5)) (and (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) 1) (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) 1) .cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) 1) .cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 2) (<= 2 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) .cse3 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) .cse5))) [2022-01-10 23:38:49,902 INFO L858 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2022-01-10 23:38:49,902 INFO L858 garLoopResultBuilder]: For program point L577-2(lines 577 579) no Hoare annotation was computed. [2022-01-10 23:38:49,902 INFO L854 garLoopResultBuilder]: At program point L599(lines 585 600) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|))) (let ((.cse0 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 1) 4294967296)) (.cse3 (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| 1)) (.cse2 (select .cse1 0))) (and (<= .cse0 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|) (<= 2 .cse0) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0) (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0) 0) (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) 0) 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) (= (select .cse1 8) .cse2) (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) 0) (or (<= (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (<= .cse3 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|)) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0)) (or (<= .cse3 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (<= (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|)) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 0) (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt| .cse2)) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 0) (< 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)))) [2022-01-10 23:38:49,902 INFO L861 garLoopResultBuilder]: At program point L573-1(line 573) the Hoare annotation is: true [2022-01-10 23:38:49,902 INFO L858 garLoopResultBuilder]: For program point L577-3(lines 577 579) no Hoare annotation was computed. [2022-01-10 23:38:49,903 INFO L854 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse27 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|)) (.cse4 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (let ((.cse25 (select .cse4 8)) (.cse5 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse26 (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| 1)) (.cse20 (select .cse27 0)) (.cse28 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 1) 4294967296))) (let ((.cse0 (<= .cse28 2)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|)) (.cse2 (<= 2 .cse28)) (.cse13 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0)) (.cse14 (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|)) (.cse3 (<= 1 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|)) (.cse10 (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse11 (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16)) (.cse15 (= (select .cse27 8) .cse20)) (.cse16 (or (<= (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (<= .cse26 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|))) (.cse17 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0))) (.cse6 (= (select .cse5 0) 0)) (.cse18 (or (<= .cse26 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (<= (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (.cse19 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 0)) (.cse7 (= .cse25 (select .cse4 0))) (.cse8 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse23 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 0)) (.cse9 (< 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648))) (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2) (= (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296) (select (select |#memory_intInt| (select .cse4 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (mod (+ 16 (select .cse5 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616))) (= 2 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse6 .cse7 (not .cse8) .cse9 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (= 2 (select .cse10 .cse11)) .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse14 (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0) 0) (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) 0) 0) .cse3 .cse15 (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) 0) (<= (+ 2 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) .cse16 .cse17 .cse6 .cse18 .cse19 .cse7 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (+ 2 (* 2 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|))) (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt| .cse20)) (forall ((v_ArrVal_1494 Int) (v_ArrVal_1499 (Array Int Int))) (let ((.cse21 (store (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1494))) (let ((.cse22 (select .cse21 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= (select (select (store (store |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| .cse21) .cse22 v_ArrVal_1499) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) .cse22)))) .cse23 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) .cse9 .cse12) (let ((.cse24 (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (and .cse0 .cse1 .cse2 .cse13 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int|) .cse14 (< |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 4294967296) .cse3 (= .cse24 (select .cse10 (mod .cse11 18446744073709551616))) .cse15 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) (<= (div (+ (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 1) 4294967296)) (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (= .cse24 |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) .cse16 (or (<= (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt| 1) .cse20) (<= (+ .cse20 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|)) .cse17 .cse6 .cse18 .cse19 .cse7 .cse8 .cse23 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 1) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse9 (or (<= (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| 1) .cse25) (<= (+ .cse25 1) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) .cse12)))))) [2022-01-10 23:38:49,903 INFO L854 garLoopResultBuilder]: At program point L583-1(lines 575 584) the Hoare annotation is: (and (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) 1) (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) 1) (not (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|)) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) 1) (<= 1 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 2) (<= 2 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|) (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0) (<= 1 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (< 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) [2022-01-10 23:38:49,903 INFO L858 garLoopResultBuilder]: For program point L631-4(lines 631 634) no Hoare annotation was computed. [2022-01-10 23:38:49,903 INFO L854 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse27 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|)) (.cse24 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (let ((.cse22 (select .cse24 0)) (.cse20 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse25 (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| 1)) (.cse26 (select .cse27 0)) (.cse28 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 1) 4294967296))) (let ((.cse7 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse0 (<= .cse28 2)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|)) (.cse2 (<= 2 .cse28)) (.cse3 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0)) (.cse4 (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|)) (.cse19 (< |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 4294967296)) (.cse5 (<= 1 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|)) (.cse6 (= (select .cse27 8) .cse26)) (.cse8 (or (<= (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (<= .cse25 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|))) (.cse9 (or (<= (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt| 1) .cse26) (<= (+ .cse26 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|))) (.cse10 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0))) (.cse21 (= (select .cse20 0) 0)) (.cse11 (or (<= .cse25 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (<= (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 0)) (.cse13 (= (select .cse24 8) .cse22)) (.cse14 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse15 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse16 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 0)) (.cse17 (< 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) (.cse23 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296) |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|)) (.cse18 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) 0) 0) .cse5 .cse6 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) 0))) .cse7 (= (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int|) .cse4 .cse19 .cse5 .cse6 (= (select .cse20 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) (<= (div (+ (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 1) 4294967296)) .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 (not .cse15) .cse16 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| .cse22) (= (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 1) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse17 .cse23 (= 2 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16))) .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| (* (div |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2147483648) 4294967296) 1) (+ (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) .cse19 .cse5 .cse6 (forall ((v_ArrVal_557 (Array Int Int))) (<= (select (select (store |#memory_intInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) v_ArrVal_557) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616)) (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2) (<= (div (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| (- 1)) (- 4294967296)) (div (+ (* |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| (- 1)) 1) 4294967296)) (forall ((v_ArrVal_557 (Array Int Int))) (<= (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |#memory_intInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) v_ArrVal_557) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616)))) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt| 0) .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) .cse18))))) [2022-01-10 23:38:49,903 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2022-01-10 23:38:49,903 INFO L854 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (let ((.cse14 (<= (+ (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)) 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse11 (select .cse17 0)) (.cse18 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse19 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 1) 4294967296))) (let ((.cse0 (<= .cse19 2)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|)) (.cse2 (<= 2 .cse19)) (.cse5 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296) (select (select |#memory_intInt| (select .cse17 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (mod (+ 16 (select .cse18 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616)))) (.cse6 (= (select .cse18 0) 0)) (.cse7 (= (select .cse17 8) .cse11)) (.cse9 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse10 (not (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| 0))) (.cse3 (<= 1 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|)) (.cse12 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648)))) (.cse8 (let ((.cse15 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2)) (.cse16 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (or (and .cse15 .cse14 .cse16) (and .cse15 (<= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) .cse16))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) .cse8 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) (< 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) (= 2 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16))) .cse9) (and .cse0 .cse1 .cse2 .cse10 (not (= .cse11 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) .cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int|) .cse12 .cse4 (let ((.cse13 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 1) 4294967296))) (<= (div (+ .cse13 (- 1)) (- 4294967296)) (div (+ (* .cse13 (- 1)) 1) 4294967296))) (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) .cse5 .cse14 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse3 .cse12 .cse4 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse14 .cse8))))) [2022-01-10 23:38:49,903 INFO L858 garLoopResultBuilder]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2022-01-10 23:38:49,903 INFO L858 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2022-01-10 23:38:49,903 INFO L858 garLoopResultBuilder]: For program point L635-4(lines 635 640) no Hoare annotation was computed. [2022-01-10 23:38:49,904 INFO L854 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (let ((.cse19 (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse25 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse24 (select .cse23 0)) (.cse30 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 1) 4294967296))) (let ((.cse13 (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.baseInt|)) (.cse14 (+ 16 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|)) (.cse0 (<= .cse30 2)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|)) (.cse2 (<= 2 .cse30)) (.cse3 (not (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| 0))) (.cse4 (not (= .cse24 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse5 (< |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 4294967296)) (.cse6 (let ((.cse28 (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)))) (let ((.cse26 (<= (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| (* (div |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2147483648) 4294967296) 1) (+ .cse28 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (.cse27 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2)) (.cse29 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (or (and .cse26 .cse27 (<= (+ .cse28 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse29) (and .cse26 .cse27 (<= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) .cse29))))) (.cse7 (<= 1 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|)) (.cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse9 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int|)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648)))) (.cse12 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296) (select (select |#memory_intInt| (select .cse23 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (mod (+ 16 (select .cse25 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616)))) (.cse15 (= (select .cse25 0) 0)) (.cse16 (= (select .cse23 8) .cse24)) (.cse17 (<= (div (+ (- 3) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) (- 4294967296)) (div (+ .cse19 3) 4294967296))) (.cse18 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (let ((.cse11 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 1) 4294967296))) (<= (div (+ .cse11 (- 1)) (- 4294967296)) (div (+ (* .cse11 (- 1)) 1) 4294967296))) .cse12 (= (select .cse13 (mod .cse14 18446744073709551616)) (mod |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 4294967296)) (<= (div (+ (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 1) 4294967296)) .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (div (+ (- 2) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) (- 4294967296)) (div (+ .cse19 2) 4294967296)) .cse10 .cse12 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|) (= (select .cse13 .cse14) 2) .cse15 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt| 0) .cse16 (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 0) (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) (< 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) (= 2 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16))) .cse18) (let ((.cse22 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.baseInt|))) (let ((.cse21 (select (select |#memory_intInt| (select .cse22 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|)) 16)) (.cse20 (select .cse22 8))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt| 0) .cse7 .cse8 (not (= .cse20 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.baseInt|)) .cse9 (<= .cse21 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) (< |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 4294967296) (<= |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| .cse21) .cse10 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) .cse12 (<= (div (+ (- 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int|) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int|) 1) 4294967296)) .cse15 .cse16 (= .cse20 (select .cse22 0)) .cse17 (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|) 0) .cse18))))))) [2022-01-10 23:38:49,904 INFO L858 garLoopResultBuilder]: For program point L619(lines 619 625) no Hoare annotation was computed. [2022-01-10 23:38:49,904 INFO L858 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-01-10 23:38:49,904 INFO L858 garLoopResultBuilder]: For program point L613-3(lines 613 616) no Hoare annotation was computed. [2022-01-10 23:38:49,904 INFO L858 garLoopResultBuilder]: For program point L631-2(lines 631 634) no Hoare annotation was computed. [2022-01-10 23:38:49,904 INFO L861 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-01-10 23:38:49,904 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-01-10 23:38:49,904 INFO L854 garLoopResultBuilder]: At program point L617(lines 612 618) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (let ((.cse3 (select .cse17 0)) (.cse18 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse23 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 1) 4294967296))) (let ((.cse0 (<= .cse23 2)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|)) (.cse2 (<= 2 .cse23)) (.cse4 (< |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 4294967296)) (.cse5 (let ((.cse21 (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)))) (let ((.cse19 (<= (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| (* (div |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2147483648) 4294967296) 1) (+ .cse21 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2)) (.cse22 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (or (and .cse19 .cse20 (<= (+ .cse21 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse22) (and .cse19 .cse20 (<= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) .cse22))))) (.cse7 (<= 1 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|)) (.cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse15 (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648)))) (.cse10 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296) (select (select |#memory_intInt| (select .cse17 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (mod (+ 16 (select .cse18 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616)))) (.cse11 (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.baseInt|)) (.cse12 (+ 16 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|)) (.cse13 (= (select .cse18 0) 0)) (.cse14 (= (select .cse17 8) .cse3)) (.cse16 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0))) (or (let ((.cse6 (mod |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 4294967296))) (and .cse0 .cse1 .cse2 (not (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| 0)) (not (= .cse3 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) .cse4 .cse5 (= .cse6 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_#res#1Int|) .cse7 .cse8 .cse9 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) .cse10 (= (select .cse11 (mod .cse12 18446744073709551616)) .cse6) .cse13 .cse14 (<= (div (+ (- 3) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) (- 4294967296)) (div (+ .cse15 3) 4294967296)) .cse16)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int|) (<= (div (+ (- 2) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) (- 4294967296)) (div (+ .cse15 2) 4294967296)) (= 2 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_#res#1Int|) .cse9 .cse10 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|) (= (select .cse11 .cse12) 2) .cse13 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt| 0) .cse14 (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 0) (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) (< 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) (= 2 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16))) .cse16))))) [2022-01-10 23:38:49,904 INFO L858 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2022-01-10 23:38:49,904 INFO L861 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2022-01-10 23:38:49,904 INFO L858 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2022-01-10 23:38:49,904 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 23:38:49,904 INFO L854 garLoopResultBuilder]: At program point L638(lines 626 645) the Hoare annotation is: false [2022-01-10 23:38:49,904 INFO L858 garLoopResultBuilder]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2022-01-10 23:38:49,904 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 23:38:49,905 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2022-01-10 23:38:49,907 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:49,908 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 23:38:49,915 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Cannot access array with 64bit indices via 1bit term. at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.bvinttranslation.IntToBvBackTranslation.convertApplicationTerm(IntToBvBackTranslation.java:780) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation.IcfgTransformationObserver.lambda$0(IcfgTransformationObserver.java:355) at de.uni_freiburg.informatik.ultimate.icfgtransformer.IcfgTransformationBacktranslator.translateExpression(IcfgTransformationBacktranslator.java:113) at de.uni_freiburg.informatik.ultimate.icfgtransformer.IcfgTransformationBacktranslator.translateExpression(IcfgTransformationBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-10 23:38:49,923 INFO L158 Benchmark]: Toolchain (without parser) took 61514.33ms. Allocated memory was 207.6MB in the beginning and 318.8MB in the end (delta: 111.1MB). Free memory was 160.6MB in the beginning and 247.7MB in the end (delta: -87.1MB). Peak memory consumption was 173.0MB. Max. memory is 8.0GB. [2022-01-10 23:38:49,924 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 178.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 23:38:49,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.69ms. Allocated memory is still 207.6MB. Free memory was 160.4MB in the beginning and 176.3MB in the end (delta: -15.9MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-01-10 23:38:49,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.29ms. Allocated memory is still 207.6MB. Free memory was 176.3MB in the beginning and 173.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 23:38:49,924 INFO L158 Benchmark]: Boogie Preprocessor took 18.84ms. Allocated memory is still 207.6MB. Free memory was 173.7MB in the beginning and 171.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 23:38:49,924 INFO L158 Benchmark]: RCFGBuilder took 428.03ms. Allocated memory is still 207.6MB. Free memory was 171.6MB in the beginning and 155.9MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-01-10 23:38:49,924 INFO L158 Benchmark]: IcfgTransformer took 106.45ms. Allocated memory is still 207.6MB. Free memory was 155.9MB in the beginning and 149.0MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-10 23:38:49,925 INFO L158 Benchmark]: TraceAbstraction took 60643.71ms. Allocated memory was 207.6MB in the beginning and 318.8MB in the end (delta: 111.1MB). Free memory was 148.5MB in the beginning and 247.7MB in the end (delta: -99.2MB). Peak memory consumption was 160.7MB. Max. memory is 8.0GB. [2022-01-10 23:38:49,926 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 178.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 279.69ms. Allocated memory is still 207.6MB. Free memory was 160.4MB in the beginning and 176.3MB in the end (delta: -15.9MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.29ms. Allocated memory is still 207.6MB. Free memory was 176.3MB in the beginning and 173.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.84ms. Allocated memory is still 207.6MB. Free memory was 173.7MB in the beginning and 171.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 428.03ms. Allocated memory is still 207.6MB. Free memory was 171.6MB in the beginning and 155.9MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 106.45ms. Allocated memory is still 207.6MB. Free memory was 155.9MB in the beginning and 149.0MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 60643.71ms. Allocated memory was 207.6MB in the beginning and 318.8MB in the end (delta: 111.1MB). Free memory was 148.5MB in the beginning and 247.7MB in the end (delta: -99.2MB). Peak memory consumption was 160.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 643]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.6s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 994 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 994 mSDsluCounter, 2335 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 875 IncrementalHoareTripleChecker+Unchecked, 1924 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1928 IncrementalHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 411 mSDtfsCounter, 1928 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 814 GetRequests, 524 SyntacticMatches, 30 SemanticMatches, 260 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1654 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=11, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 136 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 34 NumberOfFragments, 2720 HoareAnnotationTreeSize, 14 FomulaSimplifications, 257 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 14 FomulaSimplificationsInter, 71988 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 8.1s SatisfiabilityAnalysisTime, 39.9s InterpolantComputationTime, 769 NumberOfCodeBlocks, 768 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1061 ConstructedInterpolants, 53 QuantifiedInterpolants, 15050 SizeOfPredicates, 111 NumberOfNonLiveVariables, 6124 ConjunctsInSsa, 331 ConjunctsInUnsatCore, 32 InterpolantComputations, 5 PerfectInterpolantSequences, 223/406 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 0 - ExceptionOrErrorResult: AssertionError: Cannot access array with 64bit indices via 1bit term. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Cannot access array with 64bit indices via 1bit term.: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.bvinttranslation.IntToBvBackTranslation.convertApplicationTerm(IntToBvBackTranslation.java:780) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-10 23:38:49,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...