/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 18:25:37,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 18:25:37,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 18:25:37,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 18:25:37,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 18:25:37,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 18:25:37,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 18:25:37,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 18:25:37,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 18:25:37,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 18:25:37,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 18:25:37,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 18:25:37,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 18:25:37,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 18:25:37,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 18:25:37,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 18:25:37,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 18:25:37,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 18:25:37,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 18:25:37,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 18:25:37,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 18:25:37,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 18:25:37,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 18:25:37,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 18:25:37,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 18:25:37,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 18:25:37,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 18:25:37,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 18:25:37,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 18:25:37,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 18:25:37,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 18:25:37,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 18:25:37,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 18:25:37,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 18:25:37,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 18:25:37,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 18:25:37,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 18:25:37,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 18:25:37,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 18:25:37,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 18:25:37,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 18:25:37,326 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 18:25:37,361 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 18:25:37,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 18:25:37,362 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 18:25:37,362 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 18:25:37,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 18:25:37,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 18:25:37,363 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 18:25:37,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 18:25:37,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 18:25:37,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 18:25:37,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 18:25:37,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 18:25:37,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 18:25:37,365 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 18:25:37,365 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 18:25:37,365 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 18:25:37,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 18:25:37,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 18:25:37,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 18:25:37,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 18:25:37,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 18:25:37,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 18:25:37,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 18:25:37,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 18:25:37,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 18:25:37,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 18:25:37,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 18:25:37,368 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 18:25:37,368 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 18:25:37,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 18:25:37,368 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 18:25:37,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 18:25:37,370 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 18:25:37,370 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 18:25:37,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 18:25:37,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 18:25:37,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 18:25:37,564 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 18:25:37,565 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 18:25:37,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.i [2022-01-10 18:25:37,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbdf3fe60/ef59c98f02f24aeeb2a86d48408c9cdf/FLAG4bd449145 [2022-01-10 18:25:38,053 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 18:25:38,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.i [2022-01-10 18:25:38,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbdf3fe60/ef59c98f02f24aeeb2a86d48408c9cdf/FLAG4bd449145 [2022-01-10 18:25:38,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbdf3fe60/ef59c98f02f24aeeb2a86d48408c9cdf [2022-01-10 18:25:38,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 18:25:38,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 18:25:38,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 18:25:38,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 18:25:38,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 18:25:38,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:25:38" (1/1) ... [2022-01-10 18:25:38,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4cd1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38, skipping insertion in model container [2022-01-10 18:25:38,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:25:38" (1/1) ... [2022-01-10 18:25:38,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 18:25:38,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 18:25:38,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.i[36399,36412] [2022-01-10 18:25:38,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:25:38,494 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 18:25:38,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-with-pointer/system-with-recursion.i[36399,36412] [2022-01-10 18:25:38,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:25:38,580 INFO L208 MainTranslator]: Completed translation [2022-01-10 18:25:38,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38 WrapperNode [2022-01-10 18:25:38,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 18:25:38,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 18:25:38,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 18:25:38,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 18:25:38,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38" (1/1) ... [2022-01-10 18:25:38,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38" (1/1) ... [2022-01-10 18:25:38,640 INFO L137 Inliner]: procedures = 188, calls = 149, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 331 [2022-01-10 18:25:38,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 18:25:38,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 18:25:38,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 18:25:38,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 18:25:38,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38" (1/1) ... [2022-01-10 18:25:38,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38" (1/1) ... [2022-01-10 18:25:38,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38" (1/1) ... [2022-01-10 18:25:38,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38" (1/1) ... [2022-01-10 18:25:38,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38" (1/1) ... [2022-01-10 18:25:38,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38" (1/1) ... [2022-01-10 18:25:38,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38" (1/1) ... [2022-01-10 18:25:38,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 18:25:38,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 18:25:38,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 18:25:38,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 18:25:38,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38" (1/1) ... [2022-01-10 18:25:38,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 18:25:38,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 18:25:38,722 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 18:25:38,731 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 18:25:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-01-10 18:25:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 18:25:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2022-01-10 18:25:38,754 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2022-01-10 18:25:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 18:25:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2022-01-10 18:25:38,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2022-01-10 18:25:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 18:25:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 18:25:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 18:25:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2022-01-10 18:25:38,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2022-01-10 18:25:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2022-01-10 18:25:38,755 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2022-01-10 18:25:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 18:25:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2022-01-10 18:25:38,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2022-01-10 18:25:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 18:25:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 18:25:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 18:25:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-01-10 18:25:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2022-01-10 18:25:38,756 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2022-01-10 18:25:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2022-01-10 18:25:38,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2022-01-10 18:25:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-01-10 18:25:38,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 18:25:38,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 18:25:38,882 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 18:25:38,883 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 18:25:41,358 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 18:25:41,365 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 18:25:41,365 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 18:25:41,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:25:41 BoogieIcfgContainer [2022-01-10 18:25:41,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 18:25:41,370 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 18:25:41,370 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 18:25:41,372 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 18:25:41,374 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:25:41" (1/1) ... [2022-01-10 18:25:41,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 06:25:41 BasicIcfg [2022-01-10 18:25:41,560 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 18:25:41,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 18:25:41,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 18:25:41,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 18:25:41,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:25:38" (1/4) ... [2022-01-10 18:25:41,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a20c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:25:41, skipping insertion in model container [2022-01-10 18:25:41,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:25:38" (2/4) ... [2022-01-10 18:25:41,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a20c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:25:41, skipping insertion in model container [2022-01-10 18:25:41,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:25:41" (3/4) ... [2022-01-10 18:25:41,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a20c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:25:41, skipping insertion in model container [2022-01-10 18:25:41,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 06:25:41" (4/4) ... [2022-01-10 18:25:41,566 INFO L111 eAbstractionObserver]: Analyzing ICFG system-with-recursion.iTransformedIcfg [2022-01-10 18:25:41,570 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 18:25:41,570 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 18:25:41,606 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 18:25:41,611 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 18:25:41,612 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 18:25:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-10 18:25:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 18:25:41,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:25:41,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:25:41,632 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:25:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:25:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2145141775, now seen corresponding path program 1 times [2022-01-10 18:25:41,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:25:41,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694446782] [2022-01-10 18:25:41,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:25:41,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:25:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:25:41,965 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 18:25:41,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:25:41,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694446782] [2022-01-10 18:25:41,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694446782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:25:41,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:25:41,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:25:41,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877507987] [2022-01-10 18:25:41,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:25:41,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:25:41,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:25:42,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:25:42,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:25:42,010 INFO L87 Difference]: Start difference. First operand has 131 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:25:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:25:42,086 INFO L93 Difference]: Finished difference Result 255 states and 377 transitions. [2022-01-10 18:25:42,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:25:42,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 18:25:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:25:42,099 INFO L225 Difference]: With dead ends: 255 [2022-01-10 18:25:42,099 INFO L226 Difference]: Without dead ends: 123 [2022-01-10 18:25:42,108 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 18:25:42,111 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:25:42,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:25:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-10 18:25:42,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-01-10 18:25:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 18:25:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2022-01-10 18:25:42,159 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 16 [2022-01-10 18:25:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:25:42,160 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2022-01-10 18:25:42,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:25:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2022-01-10 18:25:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 18:25:42,162 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:25:42,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:25:42,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 18:25:42,162 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:25:42,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:25:42,164 INFO L85 PathProgramCache]: Analyzing trace with hash 828577722, now seen corresponding path program 1 times [2022-01-10 18:25:42,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:25:42,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546998215] [2022-01-10 18:25:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:25:42,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:25:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:25:42,566 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 18:25:42,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:25:42,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546998215] [2022-01-10 18:25:42,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546998215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:25:42,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:25:42,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 18:25:42,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484756862] [2022-01-10 18:25:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:25:42,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 18:25:42,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:25:42,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 18:25:42,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-10 18:25:42,570 INFO L87 Difference]: Start difference. First operand 123 states and 173 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:25:45,537 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 18:25:47,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:25:47,166 INFO L93 Difference]: Finished difference Result 314 states and 444 transitions. [2022-01-10 18:25:47,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 18:25:47,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 18:25:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:25:47,170 INFO L225 Difference]: With dead ends: 314 [2022-01-10 18:25:47,170 INFO L226 Difference]: Without dead ends: 160 [2022-01-10 18:25:47,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-01-10 18:25:47,172 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 262 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-01-10 18:25:47,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 788 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 252 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-01-10 18:25:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-01-10 18:25:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 153. [2022-01-10 18:25:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 122 states have (on average 1.4262295081967213) internal successors, (174), 125 states have internal predecessors, (174), 23 states have call successors, (23), 11 states have call predecessors, (23), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 18:25:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 213 transitions. [2022-01-10 18:25:47,187 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 213 transitions. Word has length 17 [2022-01-10 18:25:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:25:47,188 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 213 transitions. [2022-01-10 18:25:47,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:25:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 213 transitions. [2022-01-10 18:25:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 18:25:47,190 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:25:47,190 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:25:47,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 18:25:47,190 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:25:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:25:47,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1646002691, now seen corresponding path program 1 times [2022-01-10 18:25:47,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:25:47,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63640397] [2022-01-10 18:25:47,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:25:47,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:25:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:25:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 18:25:47,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:25:47,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63640397] [2022-01-10 18:25:47,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63640397] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 18:25:47,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897086178] [2022-01-10 18:25:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:25:47,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 18:25:47,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 18:25:47,536 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 18:25:47,557 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 18:25:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:25:47,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 18:25:47,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 18:25:48,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 18:25:48,040 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 18:25:48,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 18:25:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 18:25:48,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 18:25:48,245 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_247 (Array Int Int))) (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store |c_#memory_intInt| |c_system_initialize_system_initialize_~#e~1.baseInt| v_ArrVal_247) c_~user~0.baseInt) c_~user~0.offsetInt)))) is different from false [2022-01-10 18:25:50,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_1| Int)) (or (forall ((v_ArrVal_247 (Array Int Int))) (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_1| v_ArrVal_247) c_~user~0.baseInt) c_~user~0.offsetInt)))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_1|)))) is different from false [2022-01-10 18:25:50,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_1| Int) (v_ArrVal_247 (Array Int Int))) (or (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_1| v_ArrVal_247) c_~user~0.baseInt) c_~user~0.offsetInt))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_1|)))) is different from false [2022-01-10 18:25:50,494 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 33 treesize of output 25 [2022-01-10 18:25:50,499 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 20 treesize of output 18 [2022-01-10 18:25:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 18:25:50,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897086178] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 18:25:50,595 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 18:25:50,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 29 [2022-01-10 18:25:50,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437784746] [2022-01-10 18:25:50,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 18:25:50,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-10 18:25:50,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:25:50,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-10 18:25:50,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=554, Unknown=4, NotChecked=150, Total=812 [2022-01-10 18:25:50,598 INFO L87 Difference]: Start difference. First operand 153 states and 213 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 11 states have call successors, (14), 11 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:25:52,318 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt))) (let ((.cse0 (= ~sys_state_s~0~AS_NULLInt .cse1))) (and (<= c_event_precess_event_precess_~status~0Int ~sys_state_s~0~AS_NULLInt) (< c_~user~0.baseInt |c_#StackHeapBarrierInt|) (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) .cse0 (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_1| Int) (v_ArrVal_247 (Array Int Int))) (or (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_1| v_ArrVal_247) c_~user~0.baseInt) c_~user~0.offsetInt))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_1|)))) (= ~sys_state_s~0~AS_NULLInt c_event_precess_event_precess_~status~0Int) (or (and .cse0 |c_event_precess_event_precess_#t~switch73Int|) (and (not |c_event_precess_event_precess_#t~switch73Int|) (not .cse0))) (= .cse1 c_event_precess_event_precess_~status~0Int) (= (+ (- 1) ~sys_state_s~0~AS_NULLInt) 0) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|)))) is different from false [2022-01-10 18:25:52,325 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) (= ~sys_state_s~0~AS_NULLInt (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt)) (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_1| Int) (v_ArrVal_247 (Array Int Int))) (or (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_1| v_ArrVal_247) c_~user~0.baseInt) c_~user~0.offsetInt))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_1|)))) (= (+ (- 1) ~sys_state_s~0~AS_NULLInt) 0) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|)) is different from false [2022-01-10 18:25:54,337 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_1| Int)) (or (forall ((v_ArrVal_247 (Array Int Int))) (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_1| v_ArrVal_247) c_~user~0.baseInt) c_~user~0.offsetInt)))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_1|)))) (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) (= ~sys_state_s~0~AS_NULLInt (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt)) (= (+ (- 1) ~sys_state_s~0~AS_NULLInt) 0) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|)) is different from false [2022-01-10 18:26:00,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 18:26:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:02,809 INFO L93 Difference]: Finished difference Result 459 states and 651 transitions. [2022-01-10 18:26:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 18:26:02,810 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 11 states have call successors, (14), 11 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-10 18:26:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:02,812 INFO L225 Difference]: With dead ends: 459 [2022-01-10 18:26:02,812 INFO L226 Difference]: Without dead ends: 258 [2022-01-10 18:26:02,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=242, Invalid=1035, Unknown=7, NotChecked=438, Total=1722 [2022-01-10 18:26:02,814 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 412 mSDsluCounter, 3180 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 3368 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 905 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:02,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 3368 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 803 Invalid, 0 Unknown, 905 Unchecked, 9.8s Time] [2022-01-10 18:26:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-01-10 18:26:02,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 235. [2022-01-10 18:26:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 185 states have (on average 1.4216216216216215) internal successors, (263), 191 states have internal predecessors, (263), 39 states have call successors, (39), 17 states have call predecessors, (39), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-01-10 18:26:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 328 transitions. [2022-01-10 18:26:02,835 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 328 transitions. Word has length 29 [2022-01-10 18:26:02,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:02,835 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 328 transitions. [2022-01-10 18:26:02,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 11 states have call successors, (14), 11 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:26:02,835 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 328 transitions. [2022-01-10 18:26:02,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 18:26:02,837 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:02,837 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:02,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 18:26:03,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 18:26:03,061 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:03,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:03,062 INFO L85 PathProgramCache]: Analyzing trace with hash -418874637, now seen corresponding path program 1 times [2022-01-10 18:26:03,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:03,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417004432] [2022-01-10 18:26:03,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:03,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 18:26:03,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:03,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417004432] [2022-01-10 18:26:03,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417004432] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 18:26:03,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472570356] [2022-01-10 18:26:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:03,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 18:26:03,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 18:26:03,356 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 18:26:03,357 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 18:26:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:03,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-10 18:26:03,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 18:26:03,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 18:26:03,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 18:26:03,723 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 18:26:03,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 18:26:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 18:26:03,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 18:26:03,889 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_396 (Array Int Int))) (not (= (select (select (store |c_#memory_intInt| |c_system_initialize_system_initialize_~#e~1.baseInt| v_ArrVal_396) c_~user~0.baseInt) c_~user~0.offsetInt) ~sys_state_s~0~AS_IDLEInt))) is different from false [2022-01-10 18:26:03,913 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_2| Int)) (or (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_2|)) (forall ((v_ArrVal_396 (Array Int Int))) (not (= (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_2| v_ArrVal_396) c_~user~0.baseInt) c_~user~0.offsetInt) ~sys_state_s~0~AS_IDLEInt))))) is different from false [2022-01-10 18:26:03,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_2| Int) (v_ArrVal_396 (Array Int Int))) (or (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_2|)) (not (= (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_2| v_ArrVal_396) c_~user~0.baseInt) c_~user~0.offsetInt) ~sys_state_s~0~AS_IDLEInt)))) is different from false [2022-01-10 18:26:03,964 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 18:26:03,965 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 19 treesize of output 20 [2022-01-10 18:26:03,970 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 33 treesize of output 25 [2022-01-10 18:26:03,974 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 20 treesize of output 18 [2022-01-10 18:26:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 18:26:04,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472570356] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 18:26:04,116 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 18:26:04,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 27 [2022-01-10 18:26:04,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423619858] [2022-01-10 18:26:04,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 18:26:04,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-10 18:26:04,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:04,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-10 18:26:04,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=476, Unknown=3, NotChecked=138, Total=702 [2022-01-10 18:26:04,117 INFO L87 Difference]: Start difference. First operand 235 states and 328 transitions. Second operand has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (14), 11 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:26:05,594 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt))) (and (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_2| Int) (v_ArrVal_396 (Array Int Int))) (or (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_2|)) (not (= (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_2| v_ArrVal_396) c_~user~0.baseInt) c_~user~0.offsetInt) ~sys_state_s~0~AS_IDLEInt)))) (<= |c_ASNull_ASNull_status_update_~status#1Int| ~sys_state_s~0~AS_STARTInt) (= ~sys_state_s~0~AS_STARTInt .cse0) (< c_~user~0.baseInt |c_#StackHeapBarrierInt|) (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) (= ~sys_state_s~0~AS_STARTInt |c_ASNull_ASNull_status_update_~status#1Int|) (<= .cse0 ~sys_state_s~0~AS_STARTInt) (= (+ (- 2) ~sys_state_s~0~AS_STARTInt) 0) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|))) is different from false [2022-01-10 18:26:05,605 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt))) (and (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_2| Int) (v_ArrVal_396 (Array Int Int))) (or (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_2|)) (not (= (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_2| v_ArrVal_396) c_~user~0.baseInt) c_~user~0.offsetInt) ~sys_state_s~0~AS_IDLEInt)))) (= ~sys_state_s~0~AS_STARTInt .cse0) (< c_~user~0.baseInt |c_#StackHeapBarrierInt|) (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) (<= .cse0 ~sys_state_s~0~AS_STARTInt) (= (+ (- 2) ~sys_state_s~0~AS_STARTInt) 0) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|))) is different from false [2022-01-10 18:26:07,613 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt))) (and (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_2| Int)) (or (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_2|)) (forall ((v_ArrVal_396 (Array Int Int))) (not (= (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_2| v_ArrVal_396) c_~user~0.baseInt) c_~user~0.offsetInt) ~sys_state_s~0~AS_IDLEInt))))) (= ~sys_state_s~0~AS_STARTInt .cse0) (< c_~user~0.baseInt |c_#StackHeapBarrierInt|) (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) (<= .cse0 ~sys_state_s~0~AS_STARTInt) (= (+ (- 2) ~sys_state_s~0~AS_STARTInt) 0) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|))) is different from false [2022-01-10 18:26:15,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 18:26:19,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 18:26:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:23,433 INFO L93 Difference]: Finished difference Result 628 states and 922 transitions. [2022-01-10 18:26:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 18:26:23,433 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (14), 11 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 18:26:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:23,439 INFO L225 Difference]: With dead ends: 628 [2022-01-10 18:26:23,439 INFO L226 Difference]: Without dead ends: 451 [2022-01-10 18:26:23,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=163, Invalid=785, Unknown=6, NotChecked=378, Total=1332 [2022-01-10 18:26:23,441 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 393 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 979 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:23,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 3380 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1381 Invalid, 0 Unknown, 979 Unchecked, 17.0s Time] [2022-01-10 18:26:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-01-10 18:26:23,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 414. [2022-01-10 18:26:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 328 states have (on average 1.4176829268292683) internal successors, (465), 334 states have internal predecessors, (465), 61 states have call successors, (61), 29 states have call predecessors, (61), 24 states have return successors, (57), 50 states have call predecessors, (57), 48 states have call successors, (57) [2022-01-10 18:26:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 583 transitions. [2022-01-10 18:26:23,490 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 583 transitions. Word has length 30 [2022-01-10 18:26:23,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:23,490 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 583 transitions. [2022-01-10 18:26:23,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (14), 11 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:26:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 583 transitions. [2022-01-10 18:26:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 18:26:23,492 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:23,492 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:23,519 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 18:26:23,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-10 18:26:23,719 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash -929408814, now seen corresponding path program 1 times [2022-01-10 18:26:23,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:23,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346238412] [2022-01-10 18:26:23,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:23,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 18:26:23,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:23,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346238412] [2022-01-10 18:26:23,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346238412] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:23,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:23,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 18:26:23,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807843397] [2022-01-10 18:26:23,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:23,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 18:26:23,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:23,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 18:26:23,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-10 18:26:23,954 INFO L87 Difference]: Start difference. First operand 414 states and 583 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:26:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:26,626 INFO L93 Difference]: Finished difference Result 863 states and 1220 transitions. [2022-01-10 18:26:26,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 18:26:26,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 18:26:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:26,631 INFO L225 Difference]: With dead ends: 863 [2022-01-10 18:26:26,631 INFO L226 Difference]: Without dead ends: 481 [2022-01-10 18:26:26,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-01-10 18:26:26,634 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 56 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:26,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 761 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 18:26:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-01-10 18:26:26,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2022-01-10 18:26:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 364 states have (on average 1.4120879120879122) internal successors, (514), 376 states have internal predecessors, (514), 76 states have call successors, (76), 38 states have call predecessors, (76), 24 states have return successors, (57), 50 states have call predecessors, (57), 48 states have call successors, (57) [2022-01-10 18:26:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 647 transitions. [2022-01-10 18:26:26,670 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 647 transitions. Word has length 30 [2022-01-10 18:26:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:26,671 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 647 transitions. [2022-01-10 18:26:26,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:26:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 647 transitions. [2022-01-10 18:26:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 18:26:26,674 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:26,674 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2022-01-10 18:26:26,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 18:26:26,674 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:26,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1854314432, now seen corresponding path program 2 times [2022-01-10 18:26:26,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:26,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126668949] [2022-01-10 18:26:26,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:26,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 18:26:27,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:27,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126668949] [2022-01-10 18:26:27,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126668949] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 18:26:27,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246963729] [2022-01-10 18:26:27,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 18:26:27,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 18:26:27,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 18:26:27,113 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 18:26:27,114 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 18:26:27,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 18:26:27,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 18:26:27,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-10 18:26:27,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 18:26:27,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 18:26:27,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 18:26:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 18:26:27,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 18:26:27,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246963729] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:27,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 18:26:27,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2022-01-10 18:26:27,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971641212] [2022-01-10 18:26:27,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:27,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 18:26:27,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:27,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 18:26:27,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-01-10 18:26:27,968 INFO L87 Difference]: Start difference. First operand 465 states and 647 transitions. Second operand has 10 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (6), 3 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:26:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:31,362 INFO L93 Difference]: Finished difference Result 621 states and 871 transitions. [2022-01-10 18:26:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 18:26:31,363 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (6), 3 states have call predecessors, (6), 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 18:26:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:31,367 INFO L225 Difference]: With dead ends: 621 [2022-01-10 18:26:31,367 INFO L226 Difference]: Without dead ends: 619 [2022-01-10 18:26:31,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2022-01-10 18:26:31,369 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 73 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:31,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 1311 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-01-10 18:26:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-01-10 18:26:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 565. [2022-01-10 18:26:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 442 states have (on average 1.418552036199095) internal successors, (627), 461 states have internal predecessors, (627), 91 states have call successors, (91), 45 states have call predecessors, (91), 31 states have return successors, (74), 58 states have call predecessors, (74), 59 states have call successors, (74) [2022-01-10 18:26:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 792 transitions. [2022-01-10 18:26:31,409 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 792 transitions. Word has length 41 [2022-01-10 18:26:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:31,409 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 792 transitions. [2022-01-10 18:26:31,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (6), 3 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:26:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 792 transitions. [2022-01-10 18:26:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 18:26:31,411 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:31,411 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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 18:26:31,438 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 18:26:31,638 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 18:26:31,638 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:31,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:31,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1983397151, now seen corresponding path program 1 times [2022-01-10 18:26:31,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:31,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262340961] [2022-01-10 18:26:31,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:31,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 18:26:32,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:32,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262340961] [2022-01-10 18:26:32,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262340961] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 18:26:32,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101290460] [2022-01-10 18:26:32,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:32,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 18:26:32,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 18:26:32,088 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 18:26:32,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 18:26:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:32,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-10 18:26:32,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 18:26:32,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 18:26:32,541 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 18:26:32,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 18:26:32,633 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 18:26:32,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 18:26:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 18:26:32,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 18:26:32,768 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (not (= (select (select (store |c_#memory_intInt| |c_system_initialize_system_initialize_~#e~1.baseInt| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt) ~sys_state_s~0~AS_IDLEInt))) is different from false [2022-01-10 18:26:32,785 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_3| Int)) (or (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3|)) (forall ((v_ArrVal_767 (Array Int Int))) (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt)))))) is different from false [2022-01-10 18:26:32,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int)) (|v_system_initialize_system_initialize_~#e~1.baseInt_3| Int)) (or (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3|)))) is different from false [2022-01-10 18:26:32,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (|v_system_initialize_system_initialize_~#e~1.baseInt_3| Int)) (or (not (= (select (select (store (store |c_#memory_intInt| |c_system_initialize_system_initialize_~#e~1.baseInt| v_ArrVal_766) |v_system_initialize_system_initialize_~#e~1.baseInt_3| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt) ~sys_state_s~0~AS_IDLEInt)) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3|)))) is different from false [2022-01-10 18:26:32,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_4| Int)) (or (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_4|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (|v_system_initialize_system_initialize_~#e~1.baseInt_3| Int)) (or (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_4| v_ArrVal_766) |v_system_initialize_system_initialize_~#e~1.baseInt_3| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3|)))))) is different from false [2022-01-10 18:26:33,003 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (|v_system_initialize_system_initialize_~#e~1.baseInt_4| Int) (|v_system_initialize_system_initialize_~#e~1.baseInt_3| Int)) (or (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_4| v_ArrVal_766) |v_system_initialize_system_initialize_~#e~1.baseInt_3| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3|)) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_4|)))) is different from false [2022-01-10 18:26:33,333 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 65 treesize of output 57 [2022-01-10 18:26:33,338 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 52 treesize of output 48 [2022-01-10 18:26:33,341 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 48 treesize of output 46 [2022-01-10 18:26:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2022-01-10 18:26:33,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101290460] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 18:26:33,454 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 18:26:33,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14] total 33 [2022-01-10 18:26:33,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391354599] [2022-01-10 18:26:33,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 18:26:33,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-10 18:26:33,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-10 18:26:33,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=592, Unknown=7, NotChecked=330, Total=1056 [2022-01-10 18:26:33,456 INFO L87 Difference]: Start difference. First operand 565 states and 792 transitions. Second operand has 33 states, 32 states have (on average 2.59375) internal successors, (83), 30 states have internal predecessors, (83), 13 states have call successors, (19), 13 states have call predecessors, (19), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:26:34,867 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt))) (let ((.cse0 (= ~sys_state_s~0~AS_NULLInt .cse1))) (and (<= c_event_precess_event_precess_~status~0Int ~sys_state_s~0~AS_NULLInt) (< c_~user~0.baseInt |c_#StackHeapBarrierInt|) (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) .cse0 (= ~sys_state_s~0~AS_NULLInt c_event_precess_event_precess_~status~0Int) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (|v_system_initialize_system_initialize_~#e~1.baseInt_4| Int) (|v_system_initialize_system_initialize_~#e~1.baseInt_3| Int)) (or (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_4| v_ArrVal_766) |v_system_initialize_system_initialize_~#e~1.baseInt_3| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3|)) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_4|)))) (or (and .cse0 |c_event_precess_event_precess_#t~switch73Int|) (and (not |c_event_precess_event_precess_#t~switch73Int|) (not .cse0))) (= .cse1 c_event_precess_event_precess_~status~0Int) (= (+ (- 1) ~sys_state_s~0~AS_NULLInt) 0) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|)))) is different from false [2022-01-10 18:26:34,871 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) (= ~sys_state_s~0~AS_NULLInt (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (|v_system_initialize_system_initialize_~#e~1.baseInt_4| Int) (|v_system_initialize_system_initialize_~#e~1.baseInt_3| Int)) (or (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_4| v_ArrVal_766) |v_system_initialize_system_initialize_~#e~1.baseInt_3| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3|)) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_4|)))) (= (+ (- 1) ~sys_state_s~0~AS_NULLInt) 0) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|)) is different from false [2022-01-10 18:26:36,892 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) (= ~sys_state_s~0~AS_NULLInt (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt)) (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_4| Int)) (or (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_4|)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (|v_system_initialize_system_initialize_~#e~1.baseInt_3| Int)) (or (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_4| v_ArrVal_766) |v_system_initialize_system_initialize_~#e~1.baseInt_3| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3|)))))) (= (+ (- 1) ~sys_state_s~0~AS_NULLInt) 0) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|)) is different from false [2022-01-10 18:26:36,946 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_system_initialize_system_initialize_~#e~1.baseInt| c_~user~0.baseInt)) (< c_~user~0.baseInt |c_#StackHeapBarrierInt|) (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) (= ~sys_state_s~0~AS_NULLInt (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt)) (< |c_#StackHeapBarrierInt| |c_system_initialize_system_initialize_~#e~1.baseInt|) (= (+ (- 1) ~sys_state_s~0~AS_NULLInt) 0) (forall ((v_ArrVal_767 (Array Int Int)) (|v_system_initialize_system_initialize_~#e~1.baseInt_3| Int)) (or (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3|)))) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|)) is different from false [2022-01-10 18:26:36,982 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) (= ~sys_state_s~0~AS_NULLInt (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt)) (= (+ (- 1) ~sys_state_s~0~AS_NULLInt) 0) (forall ((v_ArrVal_767 (Array Int Int)) (|v_system_initialize_system_initialize_~#e~1.baseInt_3| Int)) (or (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3|)))) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|)) is different from false [2022-01-10 18:26:36,991 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_event_precess_event_precess_~status~0Int ~sys_state_s~0~AS_NULLInt) (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) (= ~sys_state_s~0~AS_NULLInt (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt)) (= ~sys_state_s~0~AS_NULLInt c_event_precess_event_precess_~status~0Int) (= (+ (- 1) ~sys_state_s~0~AS_NULLInt) 0) (forall ((v_ArrVal_767 (Array Int Int)) (|v_system_initialize_system_initialize_~#e~1.baseInt_3| Int)) (or (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt))) (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3|)))) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|)) is different from false [2022-01-10 18:26:39,103 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ ~sys_state_s~0~AS_IDLEInt (- 3)) 0) (= ~sys_state_s~0~AS_NULLInt (select (select |c_#memory_intInt| c_~user~0.baseInt) c_~user~0.offsetInt)) (forall ((|v_system_initialize_system_initialize_~#e~1.baseInt_3| Int)) (or (not (< |c_#StackHeapBarrierInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3|)) (forall ((v_ArrVal_767 (Array Int Int))) (not (= ~sys_state_s~0~AS_IDLEInt (select (select (store |c_#memory_intInt| |v_system_initialize_system_initialize_~#e~1.baseInt_3| v_ArrVal_767) c_~user~0.baseInt) c_~user~0.offsetInt)))))) (= (+ (- 1) ~sys_state_s~0~AS_NULLInt) 0) (<= (+ c_~user~0.baseInt 1) |c_#StackHeapBarrierInt|)) is different from false [2022-01-10 18:26:47,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []