./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 e8d55036 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-?-e8d5503-m [2023-02-15 19:33:24,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:33:24,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:33:24,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:33:24,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:33:24,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:33:24,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:33:24,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:33:24,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:33:24,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:33:24,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:33:24,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:33:24,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:33:24,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:33:24,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:33:24,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:33:24,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:33:24,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:33:24,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:33:24,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:33:24,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:33:24,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:33:24,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:33:24,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:33:24,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:33:24,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:33:24,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:33:24,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:33:24,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:33:24,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:33:24,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:33:24,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:33:24,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:33:24,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:33:24,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:33:24,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:33:24,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:33:24,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:33:24,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:33:24,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:33:24,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:33:24,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:33:24,172 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:33:24,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:33:24,173 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:33:24,173 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:33:24,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:33:24,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:33:24,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:33:24,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:33:24,174 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:33:24,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:33:24,174 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:33:24,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:33:24,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:33:24,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:33:24,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:33:24,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:33:24,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:33:24,174 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:33:24,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:33:24,175 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:33:24,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:33:24,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:33:24,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:33:24,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:33:24,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:33:24,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:33:24,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:33:24,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:33:24,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:33:24,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:33:24,175 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:33:24,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:33:24,176 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:33:24,176 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:33:24,176 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:33:24,176 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-15 19:33:24,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:33:24,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:33:24,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:33:24,398 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:33:24,398 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:33:24,399 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-15 19:33:25,389 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:33:25,597 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:33:25,598 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2023-02-15 19:33:25,605 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02fc596bd/9cd03d9d94d047dd8adb9e9bae12c4e5/FLAG41b59a39c [2023-02-15 19:33:25,615 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02fc596bd/9cd03d9d94d047dd8adb9e9bae12c4e5 [2023-02-15 19:33:25,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:33:25,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:33:25,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:33:25,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:33:25,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:33:25,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61750858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25, skipping insertion in model container [2023-02-15 19:33:25,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:33:25,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:33:25,810 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-15 19:33:25,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:33:25,820 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:33:25,843 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-15 19:33:25,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:33:25,863 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:33:25,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25 WrapperNode [2023-02-15 19:33:25,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:33:25,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:33:25,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:33:25,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:33:25,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,913 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 134 [2023-02-15 19:33:25,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:33:25,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:33:25,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:33:25,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:33:25,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,948 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:33:25,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:33:25,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:33:25,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:33:25,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25" (1/1) ... [2023-02-15 19:33:25,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:33:25,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:33:25,976 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-15 19:33:25,981 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-15 19:33:26,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:33:26,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:33:26,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:33:26,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:33:26,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:33:26,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:33:26,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:33:26,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:33:26,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:33:26,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:33:26,089 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:33:26,091 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:33:26,344 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:33:26,349 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:33:26,349 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 19:33:26,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:33:26 BoogieIcfgContainer [2023-02-15 19:33:26,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:33:26,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:33:26,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:33:26,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:33:26,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:33:25" (1/3) ... [2023-02-15 19:33:26,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa86139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:33:26, skipping insertion in model container [2023-02-15 19:33:26,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:33:25" (2/3) ... [2023-02-15 19:33:26,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa86139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:33:26, skipping insertion in model container [2023-02-15 19:33:26,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:33:26" (3/3) ... [2023-02-15 19:33:26,356 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2023-02-15 19:33:26,368 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:33:26,368 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:33:26,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:33:26,411 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;@45c3776e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:33:26,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:33:26,414 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-15 19:33:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 19:33:26,418 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:33:26,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:33:26,419 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:33:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:33:26,422 INFO L85 PathProgramCache]: Analyzing trace with hash 573386926, now seen corresponding path program 1 times [2023-02-15 19:33:26,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:33:26,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6133629] [2023-02-15 19:33:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:33:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:26,638 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-15 19:33:26,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:33:26,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6133629] [2023-02-15 19:33:26,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6133629] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:33:26,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:33:26,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:33:26,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928463408] [2023-02-15 19:33:26,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:33:26,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:33:26,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:33:26,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:33:26,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:33:26,699 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-15 19:33:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:33:26,711 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2023-02-15 19:33:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:33:26,713 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-15 19:33:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:33:26,718 INFO L225 Difference]: With dead ends: 51 [2023-02-15 19:33:26,718 INFO L226 Difference]: Without dead ends: 22 [2023-02-15 19:33:26,720 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-15 19:33:26,722 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-15 19:33:26,723 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-15 19:33:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-15 19:33:26,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-15 19:33:26,745 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-15 19:33:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-15 19:33:26,747 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2023-02-15 19:33:26,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:33:26,748 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-15 19:33:26,748 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-15 19:33:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-15 19:33:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 19:33:26,749 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:33:26,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:33:26,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:33:26,749 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:33:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:33:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1170055612, now seen corresponding path program 1 times [2023-02-15 19:33:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:33:26,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159231564] [2023-02-15 19:33:26,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:33:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:26,899 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-15 19:33:26,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:33:26,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159231564] [2023-02-15 19:33:26,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159231564] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:33:26,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:33:26,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:33:26,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060017751] [2023-02-15 19:33:26,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:33:26,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:33:26,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:33:26,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:33:26,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:33:26,909 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-15 19:33:26,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:33:26,938 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2023-02-15 19:33:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:33:26,939 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-15 19:33:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:33:26,940 INFO L225 Difference]: With dead ends: 37 [2023-02-15 19:33:26,940 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 19:33:26,942 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-15 19:33:26,944 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-15 19:33:26,944 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-15 19:33:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 19:33:26,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-02-15 19:33:26,947 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-15 19:33:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-02-15 19:33:26,948 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2023-02-15 19:33:26,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:33:26,948 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-02-15 19:33:26,948 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-15 19:33:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2023-02-15 19:33:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 19:33:26,949 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:33:26,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:33:26,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:33:26,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:33:26,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:33:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1170053690, now seen corresponding path program 1 times [2023-02-15 19:33:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:33:26,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28034904] [2023-02-15 19:33:26,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:26,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:33:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:27,200 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-15 19:33:27,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:33:27,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28034904] [2023-02-15 19:33:27,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28034904] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:33:27,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:33:27,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:33:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105528253] [2023-02-15 19:33:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:33:27,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:33:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:33:27,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:33:27,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:33:27,205 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-15 19:33:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:33:27,381 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2023-02-15 19:33:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 19:33:27,382 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-15 19:33:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:33:27,384 INFO L225 Difference]: With dead ends: 41 [2023-02-15 19:33:27,384 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 19:33:27,387 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-15 19:33:27,390 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-15 19:33:27,392 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-15 19:33:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 19:33:27,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2023-02-15 19:33:27,396 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-15 19:33:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-02-15 19:33:27,398 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2023-02-15 19:33:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:33:27,398 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-02-15 19:33:27,398 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-15 19:33:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-02-15 19:33:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 19:33:27,399 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:33:27,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:33:27,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:33:27,400 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:33:27,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:33:27,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1171900732, now seen corresponding path program 1 times [2023-02-15 19:33:27,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:33:27,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528887795] [2023-02-15 19:33:27,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:27,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:33:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:27,763 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-15 19:33:27,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:33:27,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528887795] [2023-02-15 19:33:27,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528887795] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:33:27,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:33:27,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 19:33:27,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885950839] [2023-02-15 19:33:27,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:33:27,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:33:27,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:33:27,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:33:27,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:33:27,766 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-15 19:33:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:33:27,966 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2023-02-15 19:33:27,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:33:27,967 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-15 19:33:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:33:27,967 INFO L225 Difference]: With dead ends: 93 [2023-02-15 19:33:27,968 INFO L226 Difference]: Without dead ends: 74 [2023-02-15 19:33:27,969 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-15 19:33:27,969 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-15 19:33:27,971 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-15 19:33:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-15 19:33:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2023-02-15 19:33:27,978 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-15 19:33:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2023-02-15 19:33:27,979 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 16 [2023-02-15 19:33:27,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:33:27,979 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2023-02-15 19:33:27,980 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-15 19:33:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2023-02-15 19:33:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 19:33:27,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:33:27,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:33:27,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 19:33:27,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:33:27,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:33:27,982 INFO L85 PathProgramCache]: Analyzing trace with hash 604953672, now seen corresponding path program 1 times [2023-02-15 19:33:27,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:33:27,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631707637] [2023-02-15 19:33:27,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:27,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:33:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:28,116 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-15 19:33:28,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:33:28,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631707637] [2023-02-15 19:33:28,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631707637] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:33:28,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:33:28,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:33:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014823349] [2023-02-15 19:33:28,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:33:28,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:33:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:33:28,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:33:28,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:33:28,120 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-15 19:33:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:33:28,223 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2023-02-15 19:33:28,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:33:28,223 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-15 19:33:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:33:28,226 INFO L225 Difference]: With dead ends: 87 [2023-02-15 19:33:28,226 INFO L226 Difference]: Without dead ends: 64 [2023-02-15 19:33:28,226 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-15 19:33:28,227 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-15 19:33:28,228 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-15 19:33:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-15 19:33:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2023-02-15 19:33:28,237 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-15 19:33:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2023-02-15 19:33:28,238 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2023-02-15 19:33:28,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:33:28,239 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2023-02-15 19:33:28,239 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-15 19:33:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2023-02-15 19:33:28,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 19:33:28,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:33:28,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:33:28,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 19:33:28,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:33:28,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:33:28,243 INFO L85 PathProgramCache]: Analyzing trace with hash 466614784, now seen corresponding path program 1 times [2023-02-15 19:33:28,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:33:28,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250498515] [2023-02-15 19:33:28,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:28,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:33:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:28,361 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-15 19:33:28,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:33:28,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250498515] [2023-02-15 19:33:28,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250498515] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:33:28,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:33:28,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:33:28,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278922013] [2023-02-15 19:33:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:33:28,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:33:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:33:28,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:33:28,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:33:28,363 INFO L87 Difference]: Start difference. First operand 40 states and 51 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-15 19:33:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:33:28,461 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2023-02-15 19:33:28,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 19:33:28,461 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-15 19:33:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:33:28,462 INFO L225 Difference]: With dead ends: 86 [2023-02-15 19:33:28,462 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 19:33:28,462 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-15 19:33:28,463 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 39 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 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-15 19:33:28,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 110 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:33:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 19:33:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 50. [2023-02-15 19:33:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 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-15 19:33:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2023-02-15 19:33:28,469 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 17 [2023-02-15 19:33:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:33:28,469 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2023-02-15 19:33:28,469 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-15 19:33:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2023-02-15 19:33:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 19:33:28,470 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:33:28,470 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-15 19:33:28,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 19:33:28,470 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:33:28,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:33:28,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1690516158, now seen corresponding path program 1 times [2023-02-15 19:33:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:33:28,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673714175] [2023-02-15 19:33:28,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:28,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:33:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:29,752 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-15 19:33:29,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:33:29,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673714175] [2023-02-15 19:33:29,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673714175] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:33:29,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154031447] [2023-02-15 19:33:29,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:29,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:33:29,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:33:29,756 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-15 19:33:29,757 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-15 19:33:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:29,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 96 conjunts are in the unsatisfiable core [2023-02-15 19:33:29,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:33:29,920 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-15 19:33:29,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:29,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:29,970 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-15 19:33:29,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:29,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:29,980 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-15 19:33:29,986 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-15 19:33:29,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:29,992 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-15 19:33:30,011 INFO L321 Elim1Store]: treesize reduction 19, result has 61.2 percent of original size [2023-02-15 19:33:30,011 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2023-02-15 19:33:30,016 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 0 case distinctions, treesize of input 40 treesize of output 37 [2023-02-15 19:33:30,036 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-15 19:33:30,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:30,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2023-02-15 19:33:30,099 INFO L321 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2023-02-15 19:33:30,099 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-15 19:33:30,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:30,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:30,246 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 19:33:30,247 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-15 19:33:30,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:30,260 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-15 19:33:30,294 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2023-02-15 19:33:30,294 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-15 19:33:30,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:30,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:30,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:30,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:30,311 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:33:30,313 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-15 19:33:30,325 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-15 19:33:30,350 INFO L321 Elim1Store]: treesize reduction 70, result has 35.8 percent of original size [2023-02-15 19:33:30,351 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-15 19:33:30,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:30,474 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 19:33:30,474 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-15 19:33:30,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:30,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:30,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:30,487 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 48 treesize of output 53 [2023-02-15 19:33:30,496 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-15 19:33:30,520 INFO L321 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2023-02-15 19:33:30,521 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 31 treesize of output 35 [2023-02-15 19:33:30,949 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-15 19:33:30,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:33:31,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:31,104 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-15 19:33:31,593 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0))) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((v_ArrVal_438 Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_7| Int) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_4 Int)) (or (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_438)))) (let ((.cse4 (select (select (store .cse5 v_ArrVal_438 v_ArrVal_432) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse1 (select (select (store (store (store .cse5 v_ArrVal_438 v_ArrVal_434) .cse4 v_ArrVal_453) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_445) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (let ((.cse0 (store (store (store .cse3 v_ArrVal_438 v_ArrVal_424) .cse4 v_arrayElimArr_7) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_452))) (select (select .cse0 .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) 0) (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|)))))) (not (= (select v_arrayElimArr_7 (+ v_subst_4 8)) 0)))) (not (= 0 (select (store |c_#valid| v_ArrVal_438 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_7|))))) (not (= 0 (select |c_#valid| v_ArrVal_438))))) (forall ((v_ArrVal_438 Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_7| Int) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_1 Int)) (or (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_438)))) (let ((.cse9 (select (select (store .cse10 v_ArrVal_438 v_ArrVal_432) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse8 (store (store (store .cse10 v_ArrVal_438 v_ArrVal_434) .cse9 v_ArrVal_453) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_445))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select (select .cse8 .cse7) (select (select (store (store (store .cse3 v_ArrVal_438 v_ArrVal_424) .cse9 v_arrayElimArr_7) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_452) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) 0))))))) (not (= (select v_arrayElimArr_7 (+ v_subst_1 8)) 0)))) (not (= 0 (select (store |c_#valid| v_ArrVal_438 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_7|))))) (not (= 0 (select |c_#valid| v_ArrVal_438))))) (forall ((v_ArrVal_438 Int)) (or (not (= 0 (select |c_#valid| v_ArrVal_438))) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_7| Int) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_3 Int)) (or (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_438)))) (let ((.cse14 (select (select (store .cse13 v_ArrVal_438 v_ArrVal_432) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse11 (select (select (store (store (store .cse3 v_ArrVal_438 v_ArrVal_424) .cse14 v_arrayElimArr_7) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_452) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse11 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (let ((.cse12 (store (store (store .cse13 v_ArrVal_438 v_ArrVal_434) .cse14 v_ArrVal_453) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_445))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) .cse11) 0)))))) (not (= (select v_arrayElimArr_7 (+ v_subst_3 8)) 0)))) (not (= 0 (select (store |c_#valid| v_ArrVal_438 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_7|))))))) (forall ((v_ArrVal_438 Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_7| Int) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (not (= 0 (select (store |c_#valid| v_ArrVal_438 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_7|))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_2 Int)) (or (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_438)))) (let ((.cse17 (select (select (store .cse16 v_ArrVal_438 v_ArrVal_432) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse15 (store (store (store .cse3 v_ArrVal_438 v_ArrVal_424) .cse17 v_arrayElimArr_7) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_452))) (let ((.cse18 (select (select .cse15 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select .cse15 (select (select (store (store (store .cse16 v_ArrVal_438 v_ArrVal_434) .cse17 v_ArrVal_453) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_445) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) .cse18) 0) (= .cse18 |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (not (= (select v_arrayElimArr_7 (+ v_subst_2 8)) 0)))))) (not (= 0 (select |c_#valid| v_ArrVal_438))))))) is different from false [2023-02-15 19:33:31,851 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse6 (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 (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_24| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_438 Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_7| Int) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_4 Int)) (or (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse6 |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_438)))) (let ((.cse4 (select (select (store .cse5 v_ArrVal_438 v_ArrVal_432) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse0 (select (select (store (store (store .cse5 v_ArrVal_438 v_ArrVal_434) .cse4 v_ArrVal_453) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_445) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (= (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_438 v_ArrVal_424) .cse4 v_arrayElimArr_7) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_452))) (select (select .cse1 .cse0) (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) 0)))))) (not (= (select v_arrayElimArr_7 (+ v_subst_4 8)) 0)))) (not (= 0 (select (store |c_#valid| v_ArrVal_438 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_7|))))) (not (= 0 (select |c_#valid| v_ArrVal_438))))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_24| Int)) (or (forall ((v_ArrVal_438 Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_7| Int) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_2 Int)) (or (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse6 |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_438)))) (let ((.cse10 (select (select (store .cse9 v_ArrVal_438 v_ArrVal_432) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse8 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_438 v_ArrVal_424) .cse10 v_arrayElimArr_7) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_452))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse7 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select .cse8 (select (select (store (store (store .cse9 v_ArrVal_438 v_ArrVal_434) .cse10 v_ArrVal_453) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_445) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) .cse7) 0))))))) (not (= (select v_arrayElimArr_7 (+ v_subst_2 8)) 0)))) (not (= 0 (select (store |c_#valid| v_ArrVal_438 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_7|))))) (not (= 0 (select |c_#valid| v_ArrVal_438))))) (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_438 Int)) (or (not (= 0 (select |c_#valid| v_ArrVal_438))) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_7| Int) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_3 Int)) (or (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse6 |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_438)))) (let ((.cse14 (select (select (store .cse13 v_ArrVal_438 v_ArrVal_432) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse11 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_438 v_ArrVal_424) .cse14 v_arrayElimArr_7) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_452) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse11 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (let ((.cse12 (store (store (store .cse13 v_ArrVal_438 v_ArrVal_434) .cse14 v_ArrVal_453) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_445))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) .cse11) 0)))))) (not (= (select v_arrayElimArr_7 (+ v_subst_3 8)) 0)))) (not (= 0 (select (store |c_#valid| v_ArrVal_438 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_7|))))))))) (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_438 Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_7| Int) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_1 Int)) (or (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_453 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse6 |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_438)))) (let ((.cse17 (select (select (store .cse18 v_ArrVal_438 v_ArrVal_432) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse15 (store (store (store .cse18 v_ArrVal_438 v_ArrVal_434) .cse17 v_ArrVal_453) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_445))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select .cse15 .cse16) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_438 v_ArrVal_424) .cse17 v_arrayElimArr_7) |v_ULTIMATE.start_main_#t~malloc11#1.base_7| v_ArrVal_452) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) 0) (= .cse16 |c_ULTIMATE.start_main_~head~0#1.base|))))))) (not (= (select v_arrayElimArr_7 (+ v_subst_1 8)) 0)))) (not (= 0 (select (store |c_#valid| v_ArrVal_438 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_7|))))) (not (= 0 (select |c_#valid| v_ArrVal_438))))))))) is different from false [2023-02-15 19:33:34,265 INFO L321 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2023-02-15 19:33:34,266 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 3749 treesize of output 3428 [2023-02-15 19:33:38,626 INFO L321 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2023-02-15 19:33:38,627 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 6037 treesize of output 4132 [2023-02-15 19:33:59,814 WARN L233 SmtUtils]: Spent 18.39s on a formula simplification. DAG size of input: 136 DAG size of output: 112 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-15 19:33:59,819 INFO L321 Elim1Store]: treesize reduction 544, result has 60.0 percent of original size [2023-02-15 19:33:59,934 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 1799935388 treesize of output 1771760264