./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e1ff0e6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-14 22:43:34,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 22:43:34,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 22:43:34,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 22:43:34,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 22:43:34,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 22:43:34,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 22:43:34,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 22:43:34,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 22:43:34,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 22:43:34,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 22:43:34,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 22:43:34,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 22:43:34,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 22:43:34,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 22:43:34,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 22:43:34,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 22:43:34,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 22:43:34,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 22:43:34,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 22:43:34,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 22:43:34,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 22:43:34,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 22:43:34,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 22:43:34,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 22:43:34,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 22:43:34,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 22:43:34,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 22:43:34,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 22:43:34,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 22:43:34,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 22:43:34,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 22:43:34,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 22:43:34,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 22:43:34,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 22:43:34,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 22:43:34,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 22:43:34,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 22:43:34,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 22:43:34,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 22:43:34,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 22:43:34,858 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 22:43:34,874 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 22:43:34,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 22:43:34,874 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 22:43:34,874 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 22:43:34,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 22:43:34,875 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 22:43:34,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 22:43:34,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 22:43:34,876 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 22:43:34,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 22:43:34,876 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 22:43:34,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 22:43:34,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 22:43:34,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 22:43:34,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 22:43:34,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 22:43:34,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 22:43:34,877 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 22:43:34,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 22:43:34,877 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 22:43:34,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 22:43:34,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 22:43:34,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 22:43:34,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 22:43:34,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:43:34,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 22:43:34,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 22:43:34,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 22:43:34,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 22:43:34,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 22:43:34,879 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 22:43:34,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 22:43:34,879 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 22:43:34,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 22:43:34,880 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 22:43:34,880 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2023-02-14 22:43:35,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 22:43:35,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 22:43:35,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 22:43:35,046 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 22:43:35,046 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 22:43:35,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-02-14 22:43:36,006 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 22:43:36,181 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 22:43:36,182 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-02-14 22:43:36,189 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9473e6a10/ef102873c3bb4ed5b8e97aa9e9692bed/FLAG42c3a1534 [2023-02-14 22:43:36,198 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9473e6a10/ef102873c3bb4ed5b8e97aa9e9692bed [2023-02-14 22:43:36,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 22:43:36,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 22:43:36,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 22:43:36,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 22:43:36,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 22:43:36,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b29496c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36, skipping insertion in model container [2023-02-14 22:43:36,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 22:43:36,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 22:43:36,399 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2023-02-14 22:43:36,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:43:36,413 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 22:43:36,464 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2023-02-14 22:43:36,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:43:36,491 INFO L208 MainTranslator]: Completed translation [2023-02-14 22:43:36,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36 WrapperNode [2023-02-14 22:43:36,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 22:43:36,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 22:43:36,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 22:43:36,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 22:43:36,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,522 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 134 [2023-02-14 22:43:36,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 22:43:36,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 22:43:36,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 22:43:36,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 22:43:36,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,562 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 22:43:36,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 22:43:36,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 22:43:36,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 22:43:36,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36" (1/1) ... [2023-02-14 22:43:36,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:43:36,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:43:36,591 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) [2023-02-14 22:43:36,597 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 [2023-02-14 22:43:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 22:43:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 22:43:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 22:43:36,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 22:43:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 22:43:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 22:43:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 22:43:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 22:43:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 22:43:36,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 22:43:36,728 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 22:43:36,729 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 22:43:36,995 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 22:43:36,999 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 22:43:36,999 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-14 22:43:37,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:43:37 BoogieIcfgContainer [2023-02-14 22:43:37,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 22:43:37,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 22:43:37,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 22:43:37,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 22:43:37,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:43:36" (1/3) ... [2023-02-14 22:43:37,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2806f013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:43:37, skipping insertion in model container [2023-02-14 22:43:37,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:43:36" (2/3) ... [2023-02-14 22:43:37,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2806f013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:43:37, skipping insertion in model container [2023-02-14 22:43:37,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:43:37" (3/3) ... [2023-02-14 22:43:37,010 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2023-02-14 22:43:37,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 22:43:37,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 22:43:37,081 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 22:43:37,086 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3165be72, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 22:43:37,086 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 22:43:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 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) [2023-02-14 22:43:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 22:43:37,093 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:43:37,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:43:37,094 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:43:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:43:37,099 INFO L85 PathProgramCache]: Analyzing trace with hash 573386926, now seen corresponding path program 1 times [2023-02-14 22:43:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:43:37,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67085059] [2023-02-14 22:43:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:43:37,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:43:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:43:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:43:37,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:43:37,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67085059] [2023-02-14 22:43:37,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67085059] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:43:37,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:43:37,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 22:43:37,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342883177] [2023-02-14 22:43:37,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:43:37,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 22:43:37,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:43:37,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 22:43:37,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 22:43:37,269 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2023-02-14 22:43:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:43:37,280 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2023-02-14 22:43:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 22:43:37,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2023-02-14 22:43:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:43:37,286 INFO L225 Difference]: With dead ends: 51 [2023-02-14 22:43:37,286 INFO L226 Difference]: Without dead ends: 22 [2023-02-14 22:43:37,288 INFO L412 NwaCegarLoop]: 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 [2023-02-14 22:43:37,290 INFO L413 NwaCegarLoop]: 40 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, 40 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 [2023-02-14 22:43:37,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:43:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-14 22:43:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-14 22:43:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:43:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-14 22:43:37,310 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2023-02-14 22:43:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:43:37,311 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-14 22:43:37,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2023-02-14 22:43:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-14 22:43:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 22:43:37,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:43:37,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:43:37,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 22:43:37,312 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:43:37,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:43:37,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1170055612, now seen corresponding path program 1 times [2023-02-14 22:43:37,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:43:37,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255229216] [2023-02-14 22:43:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:43:37,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:43:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:43:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:43:37,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:43:37,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255229216] [2023-02-14 22:43:37,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255229216] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:43:37,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:43:37,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 22:43:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010771675] [2023-02-14 22:43:37,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:43:37,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 22:43:37,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:43:37,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 22:43:37,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 22:43:37,394 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:43:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:43:37,423 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2023-02-14 22:43:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 22:43:37,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 22:43:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:43:37,425 INFO L225 Difference]: With dead ends: 37 [2023-02-14 22:43:37,425 INFO L226 Difference]: Without dead ends: 25 [2023-02-14 22:43:37,425 INFO L412 NwaCegarLoop]: 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 [2023-02-14 22:43:37,426 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:43:37,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:43:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-14 22:43:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-02-14 22:43:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:43:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-02-14 22:43:37,430 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2023-02-14 22:43:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:43:37,430 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-02-14 22:43:37,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:43:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2023-02-14 22:43:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 22:43:37,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:43:37,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:43:37,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 22:43:37,439 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:43:37,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:43:37,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1170053690, now seen corresponding path program 1 times [2023-02-14 22:43:37,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:43:37,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582476465] [2023-02-14 22:43:37,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:43:37,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:43:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:43:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:43:37,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:43:37,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582476465] [2023-02-14 22:43:37,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582476465] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:43:37,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:43:37,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 22:43:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540930787] [2023-02-14 22:43:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:43:37,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 22:43:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:43:37,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 22:43:37,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 22:43:37,680 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:43:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:43:37,854 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2023-02-14 22:43:37,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 22:43:37,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 22:43:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:43:37,855 INFO L225 Difference]: With dead ends: 41 [2023-02-14 22:43:37,855 INFO L226 Difference]: Without dead ends: 39 [2023-02-14 22:43:37,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-14 22:43:37,856 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:43:37,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 81 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:43:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-14 22:43:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2023-02-14 22:43:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 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) [2023-02-14 22:43:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-02-14 22:43:37,860 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2023-02-14 22:43:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:43:37,860 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-02-14 22:43:37,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:43:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-02-14 22:43:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 22:43:37,860 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:43:37,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:43:37,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 22:43:37,861 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:43:37,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:43:37,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1171900732, now seen corresponding path program 1 times [2023-02-14 22:43:37,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:43:37,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311939088] [2023-02-14 22:43:37,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:43:37,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:43:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:43:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:43:38,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:43:38,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311939088] [2023-02-14 22:43:38,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311939088] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:43:38,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:43:38,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 22:43:38,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605251329] [2023-02-14 22:43:38,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:43:38,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 22:43:38,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:43:38,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 22:43:38,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 22:43:38,308 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:43:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:43:38,524 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2023-02-14 22:43:38,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 22:43:38,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 22:43:38,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:43:38,526 INFO L225 Difference]: With dead ends: 93 [2023-02-14 22:43:38,526 INFO L226 Difference]: Without dead ends: 74 [2023-02-14 22:43:38,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-02-14 22:43:38,529 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 90 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:43:38,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 79 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:43:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-14 22:43:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2023-02-14 22:43:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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) [2023-02-14 22:43:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2023-02-14 22:43:38,541 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 16 [2023-02-14 22:43:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:43:38,541 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2023-02-14 22:43:38,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:43:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2023-02-14 22:43:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 22:43:38,543 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:43:38,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:43:38,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 22:43:38,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:43:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:43:38,544 INFO L85 PathProgramCache]: Analyzing trace with hash 604953672, now seen corresponding path program 1 times [2023-02-14 22:43:38,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:43:38,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946529772] [2023-02-14 22:43:38,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:43:38,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:43:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:43:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:43:38,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:43:38,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946529772] [2023-02-14 22:43:38,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946529772] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:43:38,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:43:38,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 22:43:38,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085711941] [2023-02-14 22:43:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:43:38,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 22:43:38,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:43:38,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 22:43:38,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 22:43:38,698 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:43:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:43:38,796 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2023-02-14 22:43:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 22:43:38,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 22:43:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:43:38,799 INFO L225 Difference]: With dead ends: 87 [2023-02-14 22:43:38,799 INFO L226 Difference]: Without dead ends: 64 [2023-02-14 22:43:38,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 22:43:38,804 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 81 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:43:38,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 73 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:43:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-14 22:43:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2023-02-14 22:43:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:43:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2023-02-14 22:43:38,816 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2023-02-14 22:43:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:43:38,817 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2023-02-14 22:43:38,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:43:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2023-02-14 22:43:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 22:43:38,820 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:43:38,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:43:38,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 22:43:38,821 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:43:38,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:43:38,821 INFO L85 PathProgramCache]: Analyzing trace with hash 466614784, now seen corresponding path program 1 times [2023-02-14 22:43:38,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:43:38,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45830952] [2023-02-14 22:43:38,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:43:38,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:43:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:43:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:43:38,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:43:38,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45830952] [2023-02-14 22:43:38,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45830952] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:43:38,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:43:38,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 22:43:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010485636] [2023-02-14 22:43:38,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:43:38,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 22:43:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:43:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 22:43:38,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 22:43:38,952 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2023-02-14 22:43:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:43:39,111 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2023-02-14 22:43:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 22:43:39,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2023-02-14 22:43:39,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:43:39,112 INFO L225 Difference]: With dead ends: 105 [2023-02-14 22:43:39,112 INFO L226 Difference]: Without dead ends: 86 [2023-02-14 22:43:39,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-02-14 22:43:39,116 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 56 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:43:39,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 132 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:43:39,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-14 22:43:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2023-02-14 22:43:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 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) [2023-02-14 22:43:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2023-02-14 22:43:39,129 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2023-02-14 22:43:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:43:39,129 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2023-02-14 22:43:39,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) [2023-02-14 22:43:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2023-02-14 22:43:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 22:43:39,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:43:39,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:43:39,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 22:43:39,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:43:39,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:43:39,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2051498108, now seen corresponding path program 1 times [2023-02-14 22:43:39,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:43:39,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064272689] [2023-02-14 22:43:39,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:43:39,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:43:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:43:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:43:39,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:43:39,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064272689] [2023-02-14 22:43:39,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064272689] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:43:39,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:43:39,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 22:43:39,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273623038] [2023-02-14 22:43:39,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:43:39,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 22:43:39,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:43:39,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 22:43:39,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 22:43:39,240 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2023-02-14 22:43:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:43:39,346 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2023-02-14 22:43:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 22:43:39,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2023-02-14 22:43:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:43:39,347 INFO L225 Difference]: With dead ends: 84 [2023-02-14 22:43:39,347 INFO L226 Difference]: Without dead ends: 82 [2023-02-14 22:43:39,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-14 22:43:39,349 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:43:39,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 110 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:43:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-14 22:43:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 48. [2023-02-14 22:43:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 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) [2023-02-14 22:43:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2023-02-14 22:43:39,368 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2023-02-14 22:43:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:43:39,368 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2023-02-14 22:43:39,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2023-02-14 22:43:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2023-02-14 22:43:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 22:43:39,369 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:43:39,369 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:43:39,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 22:43:39,370 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:43:39,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:43:39,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1690516158, now seen corresponding path program 1 times [2023-02-14 22:43:39,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:43:39,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121107343] [2023-02-14 22:43:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:43:39,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:43:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:43:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:43:40,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:43:40,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121107343] [2023-02-14 22:43:40,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121107343] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:43:40,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210753736] [2023-02-14 22:43:40,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:43:40,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:43:40,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:43:40,659 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) [2023-02-14 22:43:40,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 22:43:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:43:40,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-14 22:43:40,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:43:40,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 22:43:40,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:40,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:40,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-02-14 22:43:40,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:40,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:40,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-02-14 22:43:40,898 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 9 [2023-02-14 22:43:40,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:40,903 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 70 treesize of output 42 [2023-02-14 22:43:40,916 INFO L321 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2023-02-14 22:43:40,916 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 33 [2023-02-14 22:43:40,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2023-02-14 22:43:40,927 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 9 [2023-02-14 22:43:40,932 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 13 [2023-02-14 22:43:41,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,050 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 22:43:41,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 65 [2023-02-14 22:43:41,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2023-02-14 22:43:41,085 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2023-02-14 22:43:41,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 111 [2023-02-14 22:43:41,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,097 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:43:41,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2023-02-14 22:43:41,123 INFO L321 Elim1Store]: treesize reduction 70, result has 35.8 percent of original size [2023-02-14 22:43:41,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 57 [2023-02-14 22:43:41,128 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 22:43:41,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,246 INFO L321 Elim1Store]: treesize reduction 76, result has 21.6 percent of original size [2023-02-14 22:43:41,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 105 [2023-02-14 22:43:41,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2023-02-14 22:43:41,264 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 13 [2023-02-14 22:43:41,280 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2023-02-14 22:43:41,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 65 [2023-02-14 22:43:41,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,672 INFO L321 Elim1Store]: treesize reduction 87, result has 3.3 percent of original size [2023-02-14 22:43:41,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 170 treesize of output 81 [2023-02-14 22:43:41,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:43:41,685 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 22:43:41,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 29 [2023-02-14 22:43:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:43:41,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:43:41,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:43:41,835 INFO L350 Elim1Store]: Elim1 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 127 treesize of output 115 [2023-02-14 22:43:44,264 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_24| Int)) (or (forall ((v_ArrVal_456 Int)) (or (not (= (select |c_#valid| v_ArrVal_456) 0)) (forall ((v_ArrVal_446 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_454 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_5 (+ 8 v_subst_3)))) (or (not (= (select (store |c_#valid| v_ArrVal_456 1) .cse0) 0)) (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_456)))) (let ((.cse5 (select (select (store .cse6 v_ArrVal_456 v_ArrVal_446) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse2 (select (select (store (store (store .cse6 v_ArrVal_456 v_ArrVal_454) .cse5 v_arrayElimArr_5) .cse0 v_ArrVal_475) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_456 v_ArrVal_450) .cse5 v_ArrVal_476) .cse0 v_ArrVal_468))) (select (select .cse1 .cse2) (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) 0) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse2))))))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_24| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_24| Int)) (or (forall ((v_ArrVal_456 Int)) (or (not (= (select |c_#valid| v_ArrVal_456) 0)) (forall ((v_ArrVal_446 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_subst_1 Int)) (let ((.cse11 (select v_arrayElimArr_5 (+ 8 v_subst_1)))) (or (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_456)))) (let ((.cse10 (select (select (store .cse12 v_ArrVal_456 v_ArrVal_446) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse8 (store (store (store .cse12 v_ArrVal_456 v_ArrVal_454) .cse10 v_arrayElimArr_5) .cse11 v_ArrVal_475))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select .cse8 .cse9) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_456 v_ArrVal_450) .cse10 v_ArrVal_476) .cse11 v_ArrVal_468) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 0) (= .cse9 |c_ULTIMATE.start_main_~head~0#1.base|))))))) (not (= (select (store |c_#valid| v_ArrVal_456 1) .cse11) 0))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_24| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_24| Int)) (or (forall ((v_ArrVal_456 Int)) (or (not (= (select |c_#valid| v_ArrVal_456) 0)) (forall ((v_ArrVal_446 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_subst_2 Int)) (let ((.cse17 (select v_arrayElimArr_5 (+ 8 v_subst_2)))) (or (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_456)))) (let ((.cse16 (select (select (store .cse15 v_ArrVal_456 v_ArrVal_446) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse14 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_456 v_ArrVal_450) .cse16 v_ArrVal_476) .cse17 v_ArrVal_468))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse13 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select .cse14 (select (select (store (store (store .cse15 v_ArrVal_456 v_ArrVal_454) .cse16 v_arrayElimArr_5) .cse17 v_ArrVal_475) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) .cse13) 0))))))) (not (= (select (store |c_#valid| v_ArrVal_456 1) .cse17) 0))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_24| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_24| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_24| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_456 Int)) (or (forall ((v_ArrVal_446 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_454 (Array Int Int))) (let ((.cse18 (select v_arrayElimArr_5 (+ 8 v_subst_4)))) (or (not (= (select (store |c_#valid| v_ArrVal_456 1) .cse18) 0)) (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_456)))) (let ((.cse21 (select (select (store .cse20 v_ArrVal_456 v_ArrVal_446) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse22 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_456 v_ArrVal_450) .cse21 v_ArrVal_476) .cse18 v_ArrVal_468) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (let ((.cse19 (store (store (store .cse20 v_ArrVal_456 v_ArrVal_454) .cse21 v_arrayElimArr_5) .cse18 v_ArrVal_475))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) .cse22) 0) (= .cse22 |c_ULTIMATE.start_main_~head~0#1.offset|))))))))) (not (= (select |c_#valid| v_ArrVal_456) 0)))))))) is different from false [2023-02-14 22:43:46,809 INFO L321 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2023-02-14 22:43:46,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3853 treesize of output 3532 [2023-02-14 22:43:54,688 WARN L233 SmtUtils]: Spent 7.86s on a formula simplification. DAG size of input: 25 DAG size of output: 22 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-14 22:43:54,693 INFO L321 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2023-02-14 22:43:54,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 6261 treesize of output 4356 [2023-02-14 22:44:08,667 WARN L233 SmtUtils]: Spent 11.93s on a formula simplification. DAG size of input: 140 DAG size of output: 116 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-14 22:44:08,669 INFO L321 Elim1Store]: treesize reduction 576, result has 60.0 percent of original size [2023-02-14 22:44:08,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2291269826 treesize of output 2262244066 [2023-02-14 22:45:30,008 WARN L233 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 415 DAG size of output: 315 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-14 22:45:30,010 INFO L321 Elim1Store]: treesize reduction 368, result has 76.4 percent of original size [2023-02-14 22:45:30,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 16 new quantified variables, introduced 91 case distinctions, treesize of input 34318182650 treesize of output 34016093028 [2023-02-14 22:46:30,886 WARN L233 SmtUtils]: Spent 30.50s on a formula simplification. DAG size of input: 115 DAG size of output: 111 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-14 22:46:30,887 INFO L321 Elim1Store]: treesize reduction 22, result has 95.1 percent of original size [2023-02-14 22:46:31,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 34603969073 treesize of output 32845132183 [2023-02-14 22:47:04,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:47:09,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:47:11,730 INFO L217 Elim1Store]: Index analysis took 272 ms