/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:35:34,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:35:34,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:35:34,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:35:34,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:35:34,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:35:34,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:35:34,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:35:34,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:35:34,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:35:34,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:35:34,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:35:34,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:35:34,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:35:34,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:35:34,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:35:34,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:35:34,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:35:34,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:35:34,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:35:34,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:35:34,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:35:34,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:35:34,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:35:34,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:35:34,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:35:34,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:35:34,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:35:34,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:35:34,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:35:34,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:35:34,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:35:34,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:35:34,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:35:34,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:35:34,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:35:34,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:35:34,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:35:34,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:35:34,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:35:34,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:35:34,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:35:34,876 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:35:34,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:35:34,876 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:35:34,876 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:35:34,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:35:34,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:35:34,877 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:35:34,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:35:34,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:35:34,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:35:34,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:35:34,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:35:34,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:35:34,878 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:35:34,878 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:35:34,878 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:35:34,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:35:34,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:35:34,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:35:34,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:35:34,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:35:34,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:35:34,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:35:34,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:35:34,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:35:34,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:35:34,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:35:34,880 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:35:34,880 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:35:34,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:35:34,880 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:35:34,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:35:34,881 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:35:34,881 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 23:35:35,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:35:35,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:35:35,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:35:35,098 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:35:35,099 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:35:35,100 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i [2022-01-10 23:35:35,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9d13c87e/54db310831c04ad3a1234fa3ed63ccbd/FLAG99e1525a8 [2022-01-10 23:35:35,483 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:35:35,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i [2022-01-10 23:35:35,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9d13c87e/54db310831c04ad3a1234fa3ed63ccbd/FLAG99e1525a8 [2022-01-10 23:35:35,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9d13c87e/54db310831c04ad3a1234fa3ed63ccbd [2022-01-10 23:35:35,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:35:35,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:35:35,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:35:35,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:35:35,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:35:35,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:35:35" (1/1) ... [2022-01-10 23:35:35,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6721121d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:35, skipping insertion in model container [2022-01-10 23:35:35,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:35:35" (1/1) ... [2022-01-10 23:35:35,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:35:35,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:35:36,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i[22534,22547] [2022-01-10 23:35:36,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i[22606,22619] [2022-01-10 23:35:36,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i[22746,22759] [2022-01-10 23:35:36,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i[22820,22833] [2022-01-10 23:35:36,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:35:36,180 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:35:36,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i[22534,22547] [2022-01-10 23:35:36,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i[22606,22619] [2022-01-10 23:35:36,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i[22746,22759] [2022-01-10 23:35:36,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-sentinel-2.i[22820,22833] [2022-01-10 23:35:36,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:35:36,248 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:35:36,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:36 WrapperNode [2022-01-10 23:35:36,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:35:36,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:35:36,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:35:36,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:35:36,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:36" (1/1) ... [2022-01-10 23:35:36,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:36" (1/1) ... [2022-01-10 23:35:36,298 INFO L137 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2022-01-10 23:35:36,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:35:36,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:35:36,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:35:36,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:35:36,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:36" (1/1) ... [2022-01-10 23:35:36,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:36" (1/1) ... [2022-01-10 23:35:36,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:36" (1/1) ... [2022-01-10 23:35:36,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:36" (1/1) ... [2022-01-10 23:35:36,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:36" (1/1) ... [2022-01-10 23:35:36,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:36" (1/1) ... [2022-01-10 23:35:36,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:36" (1/1) ... [2022-01-10 23:35:36,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:35:36,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:35:36,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:35:36,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:35:36,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:36" (1/1) ... [2022-01-10 23:35:36,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:35:36,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:35:36,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 23:35:36,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 23:35:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 23:35:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:35:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:35:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:35:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:35:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:35:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 23:35:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:35:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:35:36,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:35:36,522 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:35:36,524 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:35:36,775 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:35:36,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:35:36,779 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-01-10 23:35:36,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:35:36 BoogieIcfgContainer [2022-01-10 23:35:36,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:35:36,781 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:35:36,781 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:35:36,785 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:35:36,788 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:35:36" (1/1) ... [2022-01-10 23:35:36,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:35:36 BasicIcfg [2022-01-10 23:35:36,853 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:35:36,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:35:36,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:35:36,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:35:36,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:35:35" (1/4) ... [2022-01-10 23:35:36,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e20d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:35:36, skipping insertion in model container [2022-01-10 23:35:36,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:36" (2/4) ... [2022-01-10 23:35:36,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e20d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:35:36, skipping insertion in model container [2022-01-10 23:35:36,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:35:36" (3/4) ... [2022-01-10 23:35:36,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e20d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:35:36, skipping insertion in model container [2022-01-10 23:35:36,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:35:36" (4/4) ... [2022-01-10 23:35:36,859 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.iTransformedIcfg [2022-01-10 23:35:36,863 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:35:36,863 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-10 23:35:36,891 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:35:36,897 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 23:35:36,897 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-10 23:35:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-10 23:35:36,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:36,911 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-10 23:35:36,912 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 23:35:36,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:36,917 INFO L85 PathProgramCache]: Analyzing trace with hash 528124233, now seen corresponding path program 1 times [2022-01-10 23:35:36,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:36,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473353533] [2022-01-10 23:35:36,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:36,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:37,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:37,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473353533] [2022-01-10 23:35:37,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473353533] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:35:37,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:35:37,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:35:37,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459205868] [2022-01-10 23:35:37,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:35:37,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:35:37,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:37,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:35:37,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:35:37,137 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:37,150 INFO L93 Difference]: Finished difference Result 60 states and 97 transitions. [2022-01-10 23:35:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:35:37,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-01-10 23:35:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:37,158 INFO L225 Difference]: With dead ends: 60 [2022-01-10 23:35:37,158 INFO L226 Difference]: Without dead ends: 26 [2022-01-10 23:35:37,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:35:37,164 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:37,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:35:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-10 23:35:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-10 23:35:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-01-10 23:35:37,187 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 6 [2022-01-10 23:35:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:37,187 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-01-10 23:35:37,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-01-10 23:35:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-10 23:35:37,188 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:37,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-10 23:35:37,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:35:37,188 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 23:35:37,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:37,189 INFO L85 PathProgramCache]: Analyzing trace with hash 528154024, now seen corresponding path program 1 times [2022-01-10 23:35:37,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:37,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506013077] [2022-01-10 23:35:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:37,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:37,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:37,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506013077] [2022-01-10 23:35:37,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506013077] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:35:37,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:35:37,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:35:37,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088444770] [2022-01-10 23:35:37,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:35:37,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 23:35:37,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:37,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 23:35:37,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 23:35:37,306 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:37,389 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-01-10 23:35:37,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 23:35:37,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-01-10 23:35:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:37,391 INFO L225 Difference]: With dead ends: 31 [2022-01-10 23:35:37,391 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 23:35:37,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:35:37,392 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:37,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:35:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 23:35:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-01-10 23:35:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-01-10 23:35:37,396 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2022-01-10 23:35:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:37,396 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-01-10 23:35:37,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-01-10 23:35:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 23:35:37,397 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:37,397 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:37,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:35:37,397 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 23:35:37,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:37,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1772450028, now seen corresponding path program 1 times [2022-01-10 23:35:37,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:37,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476230565] [2022-01-10 23:35:37,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:37,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:37,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:37,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476230565] [2022-01-10 23:35:37,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476230565] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:35:37,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:35:37,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 23:35:37,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224051355] [2022-01-10 23:35:37,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:35:37,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 23:35:37,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:37,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 23:35:37,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:35:37,798 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:38,093 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-01-10 23:35:38,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 23:35:38,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-01-10 23:35:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:38,095 INFO L225 Difference]: With dead ends: 53 [2022-01-10 23:35:38,095 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 23:35:38,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-01-10 23:35:38,096 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 60 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:38,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 68 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:35:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 23:35:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2022-01-10 23:35:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-01-10 23:35:38,103 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 9 [2022-01-10 23:35:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:38,103 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-01-10 23:35:38,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-01-10 23:35:38,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 23:35:38,104 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:38,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:38,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:35:38,104 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 23:35:38,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:38,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1990755049, now seen corresponding path program 1 times [2022-01-10 23:35:38,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:38,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629393262] [2022-01-10 23:35:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:38,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:38,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:38,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629393262] [2022-01-10 23:35:38,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629393262] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:35:38,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341657928] [2022-01-10 23:35:38,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:38,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:35:38,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:35:38,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:35:38,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 23:35:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:38,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-10 23:35:38,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:35:38,647 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 15 treesize of output 11 [2022-01-10 23:35:38,665 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 23:35:38,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-01-10 23:35:38,712 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 23:35:38,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 23 [2022-01-10 23:35:38,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:38,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-01-10 23:35:38,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 23:35:38,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:38,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:38,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 23:35:38,802 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 23:35:38,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2022-01-10 23:35:38,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 23:35:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:38,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:35:39,106 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-10 23:35:39,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2022-01-10 23:35:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:39,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341657928] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:35:39,109 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:35:39,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-01-10 23:35:39,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167717375] [2022-01-10 23:35:39,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:35:39,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 23:35:39,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:39,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 23:35:39,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=133, Unknown=2, NotChecked=0, Total=182 [2022-01-10 23:35:39,112 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:39,457 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-01-10 23:35:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 23:35:39,458 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 23:35:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:39,458 INFO L225 Difference]: With dead ends: 46 [2022-01-10 23:35:39,459 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 23:35:39,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=271, Unknown=2, NotChecked=0, Total=380 [2022-01-10 23:35:39,460 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 62 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:39,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 90 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 86 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-01-10 23:35:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 23:35:39,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2022-01-10 23:35:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-01-10 23:35:39,464 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 11 [2022-01-10 23:35:39,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:39,464 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-01-10 23:35:39,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-01-10 23:35:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 23:35:39,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:39,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:39,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 23:35:39,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:35:39,676 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 23:35:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1216649435, now seen corresponding path program 1 times [2022-01-10 23:35:39,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:39,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758455558] [2022-01-10 23:35:39,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:39,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:39,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:39,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758455558] [2022-01-10 23:35:39,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758455558] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:35:39,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:35:39,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:35:39,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793434238] [2022-01-10 23:35:39,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:35:39,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 23:35:39,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:39,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 23:35:39,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:35:39,761 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:39,846 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-01-10 23:35:39,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:35:39,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 23:35:39,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:39,847 INFO L225 Difference]: With dead ends: 37 [2022-01-10 23:35:39,847 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 23:35:39,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:35:39,847 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:39,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:35:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 23:35:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-01-10 23:35:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-01-10 23:35:39,851 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 13 [2022-01-10 23:35:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:39,851 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-01-10 23:35:39,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-01-10 23:35:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 23:35:39,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:39,852 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:39,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 23:35:39,852 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 23:35:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:39,852 INFO L85 PathProgramCache]: Analyzing trace with hash 4348578, now seen corresponding path program 1 times [2022-01-10 23:35:39,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:39,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417052172] [2022-01-10 23:35:39,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:39,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:39,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:39,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417052172] [2022-01-10 23:35:39,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417052172] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:35:39,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762093464] [2022-01-10 23:35:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:39,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:35:39,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:35:39,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:35:39,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 23:35:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:40,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-10 23:35:40,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:35:40,048 INFO L353 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2022-01-10 23:35:40,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 65 [2022-01-10 23:35:40,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:40,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-01-10 23:35:40,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:40,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 23:35:40,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:40,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-10 23:35:40,133 INFO L353 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2022-01-10 23:35:40,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 65 [2022-01-10 23:35:40,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:40,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-01-10 23:35:40,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:40,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 23:35:40,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:40,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-10 23:35:40,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-01-10 23:35:40,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:40,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-10 23:35:40,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 23:35:40,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 23:35:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:40,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:35:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:40,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762093464] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:35:40,466 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:35:40,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 23:35:40,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779916806] [2022-01-10 23:35:40,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:35:40,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 23:35:40,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:40,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 23:35:40,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-10 23:35:40,468 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:40,576 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-01-10 23:35:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:35:40,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 23:35:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:40,577 INFO L225 Difference]: With dead ends: 47 [2022-01-10 23:35:40,577 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 23:35:40,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-10 23:35:40,578 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:40,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 90 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:35:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 23:35:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-10 23:35:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-01-10 23:35:40,582 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-01-10 23:35:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:40,582 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-01-10 23:35:40,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-01-10 23:35:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 23:35:40,583 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:40,583 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:40,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 23:35:40,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 23:35:40,800 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 23:35:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:40,801 INFO L85 PathProgramCache]: Analyzing trace with hash 495458244, now seen corresponding path program 1 times [2022-01-10 23:35:40,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:40,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706753809] [2022-01-10 23:35:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:40,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:41,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:41,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706753809] [2022-01-10 23:35:41,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706753809] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:35:41,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179426755] [2022-01-10 23:35:41,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:41,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:35:41,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:35:41,151 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:35:41,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 23:35:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:41,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-10 23:35:41,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:35:41,371 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 23:35:41,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-01-10 23:35:41,403 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 23:35:41,412 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 23:35:41,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 23:35:41,417 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 5 treesize of output 3 [2022-01-10 23:35:41,435 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 23:35:41,444 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 23:35:41,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 23:35:41,448 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 5 treesize of output 3 [2022-01-10 23:35:41,464 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:35:41,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-01-10 23:35:41,520 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:35:41,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-01-10 23:35:41,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-10 23:35:41,526 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 44 treesize of output 42 [2022-01-10 23:35:41,716 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 35 treesize of output 23 [2022-01-10 23:35:41,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-01-10 23:35:41,748 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 23 treesize of output 7 [2022-01-10 23:35:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:41,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:35:41,960 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 185 treesize of output 141 [2022-01-10 23:35:42,058 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_468) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|))) (or (and (or (not (<= 0 ~unnamed1~0~BLACKInt)) (< ~unnamed1~0~REDInt ~unnamed1~0~BLACKInt) (forall ((v_ArrVal_470 (Array Int Int))) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_470) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|))))) (or (< ~unnamed1~0~REDInt 0) (and (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt| 8) 18446744073709551616) (mod (+ 8 .cse0) 18446744073709551616)) (forall ((v_ArrVal_470 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_470) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|)))))) (not (<= 0 .cse0))))) is different from false [2022-01-10 23:35:42,102 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:42,102 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 97 treesize of output 89 [2022-01-10 23:35:42,107 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:42,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 81 [2022-01-10 23:35:42,116 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:42,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 113 [2022-01-10 23:35:42,120 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 113 treesize of output 109 [2022-01-10 23:35:42,129 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:42,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 133 [2022-01-10 23:35:42,152 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 84 treesize of output 82 [2022-01-10 23:35:42,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 80 [2022-01-10 23:35:42,382 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 30 treesize of output 28 [2022-01-10 23:35:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:42,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179426755] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:35:42,410 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:35:42,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-01-10 23:35:42,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483916780] [2022-01-10 23:35:42,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:35:42,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 23:35:42,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:42,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 23:35:42,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=406, Unknown=1, NotChecked=40, Total=506 [2022-01-10 23:35:42,412 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:43,263 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-01-10 23:35:43,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 23:35:43,264 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 23:35:43,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:43,265 INFO L225 Difference]: With dead ends: 64 [2022-01-10 23:35:43,265 INFO L226 Difference]: Without dead ends: 52 [2022-01-10 23:35:43,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=631, Unknown=1, NotChecked=52, Total=812 [2022-01-10 23:35:43,266 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 90 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:43,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 334 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 236 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2022-01-10 23:35:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-10 23:35:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-01-10 23:35:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-01-10 23:35:43,272 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 18 [2022-01-10 23:35:43,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:43,273 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-01-10 23:35:43,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:43,273 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-01-10 23:35:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 23:35:43,273 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:43,273 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:43,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 23:35:43,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:35:43,490 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 23:35:43,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2003010053, now seen corresponding path program 1 times [2022-01-10 23:35:43,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:43,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699731848] [2022-01-10 23:35:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:43,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:43,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:43,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699731848] [2022-01-10 23:35:43,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699731848] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:35:43,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580891546] [2022-01-10 23:35:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:43,692 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:35:43,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:35:43,693 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:35:43,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 23:35:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:43,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 60 conjunts are in the unsatisfiable core [2022-01-10 23:35:43,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:35:43,830 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:35:43,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-01-10 23:35:43,862 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 23:35:43,871 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 23:35:43,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 23:35:43,876 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 5 treesize of output 3 [2022-01-10 23:35:43,907 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-01-10 23:35:43,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 35 [2022-01-10 23:35:43,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 23:35:43,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 23:35:44,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:44,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:44,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2022-01-10 23:35:44,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2022-01-10 23:35:44,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:44,034 INFO L353 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2022-01-10 23:35:44,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 60 [2022-01-10 23:35:44,057 INFO L353 Elim1Store]: treesize reduction 20, result has 72.6 percent of original size [2022-01-10 23:35:44,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 68 [2022-01-10 23:35:44,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-01-10 23:35:44,334 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-10 23:35:44,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 56 [2022-01-10 23:35:44,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:35:44,807 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:35:44,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2022-01-10 23:35:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:44,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:35:44,911 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:44,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-01-10 23:35:44,917 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:44,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2022-01-10 23:35:44,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_635 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_641 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_14 |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt|))) (let ((.cse0 (select |c_#validInt| .cse2))) (or (not (<= 0 .cse0)) (not (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_arrayElimArr_14) .cse2 v_ArrVal_635))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|))) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_arrayElimArr_15) .cse2 v_ArrVal_641) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_main_~null~0#1.baseInt|)) (not (= (select v_arrayElimArr_15 |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt|) 0)) (not (<= .cse0 0)))))) is different from false [2022-01-10 23:35:44,970 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:44,970 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 64 treesize of output 65 [2022-01-10 23:35:44,977 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:44,977 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 68 treesize of output 61 [2022-01-10 23:35:45,027 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:45,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2065 treesize of output 1646 [2022-01-10 23:35:45,061 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:45,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2431 treesize of output 1830 [2022-01-10 23:35:45,084 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 1783 treesize of output 1735 [2022-01-10 23:35:45,109 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:45,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1741 treesize of output 1723 [2022-01-10 23:35:45,170 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:45,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1497 treesize of output 1449 [2022-01-10 23:35:45,272 INFO L353 Elim1Store]: treesize reduction 8, result has 90.1 percent of original size [2022-01-10 23:35:45,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1661 treesize of output 1405