./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 f4b24e32 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-?-f4b24e3 [2022-07-13 15:02:05,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:02:05,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:02:05,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:02:05,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:02:05,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:02:05,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:02:05,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:02:05,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:02:05,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:02:05,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:02:05,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:02:05,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:02:05,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:02:05,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:02:05,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:02:05,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:02:05,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:02:05,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:02:05,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:02:05,284 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:02:05,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:02:05,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:02:05,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:02:05,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:02:05,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:02:05,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:02:05,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:02:05,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:02:05,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:02:05,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:02:05,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:02:05,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:02:05,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:02:05,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:02:05,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:02:05,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:02:05,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:02:05,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:02:05,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:02:05,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:02:05,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:02:05,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:02:05,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:02:05,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:02:05,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:02:05,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:02:05,324 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:02:05,325 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:02:05,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:02:05,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:02:05,325 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:02:05,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:02:05,326 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:02:05,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:02:05,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:02:05,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:02:05,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:02:05,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:02:05,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:02:05,327 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:02:05,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:02:05,327 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:02:05,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:02:05,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:02:05,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:02:05,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:02:05,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:05,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:02:05,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:02:05,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:02:05,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:02:05,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:02:05,329 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:02:05,329 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:02:05,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:02:05,329 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-07-13 15:02:05,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:02:05,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:02:05,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:02:05,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:02:05,529 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:02:05,530 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 [2022-07-13 15:02:05,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1341c70/1290128a7047494ab70773d7629763e4/FLAG14245f449 [2022-07-13 15:02:05,948 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:02:05,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2022-07-13 15:02:05,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1341c70/1290128a7047494ab70773d7629763e4/FLAG14245f449 [2022-07-13 15:02:05,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1341c70/1290128a7047494ab70773d7629763e4 [2022-07-13 15:02:05,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:02:05,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:02:05,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:05,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:02:05,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:02:05,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:05" (1/1) ... [2022-07-13 15:02:05,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b61d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:05, skipping insertion in model container [2022-07-13 15:02:05,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:05" (1/1) ... [2022-07-13 15:02:05,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:02:06,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:02:06,241 WARN L230 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] [2022-07-13 15:02:06,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:06,250 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:02:06,281 WARN L230 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] [2022-07-13 15:02:06,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:06,301 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:02:06,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06 WrapperNode [2022-07-13 15:02:06,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:06,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:06,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:02:06,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:02:06,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,331 INFO L137 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 134 [2022-07-13 15:02:06,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:06,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:02:06,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:02:06,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:02:06,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:02:06,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:02:06,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:02:06,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:02:06,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (1/1) ... [2022-07-13 15:02:06,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:06,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:06,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:02:06,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:02:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:02:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:02:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:02:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:02:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:02:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:02:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:02:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:02:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:02:06,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:02:06,527 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:02:06,528 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:02:06,757 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:02:06,760 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:02:06,764 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-13 15:02:06,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:06 BoogieIcfgContainer [2022-07-13 15:02:06,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:02:06,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:02:06,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:02:06,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:02:06,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:02:05" (1/3) ... [2022-07-13 15:02:06,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545451c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:06, skipping insertion in model container [2022-07-13 15:02:06,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:06" (2/3) ... [2022-07-13 15:02:06,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545451c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:06, skipping insertion in model container [2022-07-13 15:02:06,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:06" (3/3) ... [2022-07-13 15:02:06,771 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2022-07-13 15:02:06,781 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:02:06,781 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:02:06,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:02:06,819 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53cfb16b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4666075b [2022-07-13 15:02:06,819 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:02:06,824 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) [2022-07-13 15:02:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:02:06,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:06,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:06,829 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:06,833 INFO L85 PathProgramCache]: Analyzing trace with hash 573386926, now seen corresponding path program 1 times [2022-07-13 15:02:06,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:06,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151993087] [2022-07-13 15:02:06,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:06,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:07,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:07,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151993087] [2022-07-13 15:02:07,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151993087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:07,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:07,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:02:07,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336695395] [2022-07-13 15:02:07,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:07,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:02:07,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:07,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:02:07,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:02:07,036 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) [2022-07-13 15:02:07,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:07,047 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2022-07-13 15:02:07,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:02:07,049 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 [2022-07-13 15:02:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:07,054 INFO L225 Difference]: With dead ends: 51 [2022-07-13 15:02:07,054 INFO L226 Difference]: Without dead ends: 22 [2022-07-13 15:02:07,056 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 [2022-07-13 15:02:07,061 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 [2022-07-13 15:02:07,062 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] [2022-07-13 15:02:07,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-13 15:02:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-13 15:02:07,081 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) [2022-07-13 15:02:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-07-13 15:02:07,083 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2022-07-13 15:02:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:07,083 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-13 15:02:07,083 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) [2022-07-13 15:02:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-07-13 15:02:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:02:07,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:07,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:07,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:02:07,085 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:07,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1170055612, now seen corresponding path program 1 times [2022-07-13 15:02:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:07,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472799727] [2022-07-13 15:02:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:07,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:07,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472799727] [2022-07-13 15:02:07,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472799727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:07,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:07,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:07,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118360323] [2022-07-13 15:02:07,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:07,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:07,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:07,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:07,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:07,200 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) [2022-07-13 15:02:07,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:07,241 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-07-13 15:02:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:07,241 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 [2022-07-13 15:02:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:07,242 INFO L225 Difference]: With dead ends: 37 [2022-07-13 15:02:07,242 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 15:02:07,243 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 [2022-07-13 15:02:07,248 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:07,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 15:02:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-13 15:02:07,253 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) [2022-07-13 15:02:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-07-13 15:02:07,255 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2022-07-13 15:02:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:07,255 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-07-13 15:02:07,256 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) [2022-07-13 15:02:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-07-13 15:02:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:02:07,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:07,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:07,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:02:07,258 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:07,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1170053690, now seen corresponding path program 1 times [2022-07-13 15:02:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:07,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837482248] [2022-07-13 15:02:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:07,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:07,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:07,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837482248] [2022-07-13 15:02:07,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837482248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:07,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:07,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:02:07,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806242119] [2022-07-13 15:02:07,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:07,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:02:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:07,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:02:07,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:02:07,372 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) [2022-07-13 15:02:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:07,531 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-07-13 15:02:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:02:07,531 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 [2022-07-13 15:02:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:07,532 INFO L225 Difference]: With dead ends: 41 [2022-07-13 15:02:07,532 INFO L226 Difference]: Without dead ends: 39 [2022-07-13 15:02:07,532 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 [2022-07-13 15:02:07,533 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:07,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-13 15:02:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2022-07-13 15:02:07,536 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) [2022-07-13 15:02:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-07-13 15:02:07,536 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2022-07-13 15:02:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:07,537 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-07-13 15:02:07,537 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) [2022-07-13 15:02:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-07-13 15:02:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:02:07,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:07,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:07,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:02:07,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:07,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1171900732, now seen corresponding path program 1 times [2022-07-13 15:02:07,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:07,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065479872] [2022-07-13 15:02:07,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:07,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:07,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065479872] [2022-07-13 15:02:07,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065479872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:07,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:07,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:02:07,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273320251] [2022-07-13 15:02:07,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:07,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:02:07,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:07,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:02:07,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:02:07,660 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) [2022-07-13 15:02:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:07,872 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-07-13 15:02:07,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:02:07,873 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 [2022-07-13 15:02:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:07,874 INFO L225 Difference]: With dead ends: 93 [2022-07-13 15:02:07,874 INFO L226 Difference]: Without dead ends: 74 [2022-07-13 15:02:07,874 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 [2022-07-13 15:02:07,875 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 86 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:07,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 79 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-13 15:02:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2022-07-13 15:02:07,885 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) [2022-07-13 15:02:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-07-13 15:02:07,887 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 16 [2022-07-13 15:02:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:07,887 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-07-13 15:02:07,887 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) [2022-07-13 15:02:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-07-13 15:02:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:02:07,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:07,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:07,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 15:02:07,889 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:07,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:07,890 INFO L85 PathProgramCache]: Analyzing trace with hash 604953672, now seen corresponding path program 1 times [2022-07-13 15:02:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:07,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055568592] [2022-07-13 15:02:07,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:07,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:07,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055568592] [2022-07-13 15:02:07,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055568592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:07,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:07,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:02:07,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676336393] [2022-07-13 15:02:07,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:07,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:02:07,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:07,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:02:07,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:02:07,980 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) [2022-07-13 15:02:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:08,102 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2022-07-13 15:02:08,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:02:08,102 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 [2022-07-13 15:02:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:08,106 INFO L225 Difference]: With dead ends: 87 [2022-07-13 15:02:08,106 INFO L226 Difference]: Without dead ends: 64 [2022-07-13 15:02:08,107 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 [2022-07-13 15:02:08,111 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 74 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:08,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 73 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-13 15:02:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2022-07-13 15:02:08,127 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) [2022-07-13 15:02:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-07-13 15:02:08,128 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2022-07-13 15:02:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:08,129 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-07-13 15:02:08,129 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) [2022-07-13 15:02:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-07-13 15:02:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:02:08,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:08,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:08,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 15:02:08,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash 466614784, now seen corresponding path program 1 times [2022-07-13 15:02:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:08,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777657956] [2022-07-13 15:02:08,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:08,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:08,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777657956] [2022-07-13 15:02:08,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777657956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:08,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:08,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:02:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403949259] [2022-07-13 15:02:08,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:08,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:02:08,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:08,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:02:08,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:02:08,203 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:08,342 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-07-13 15:02:08,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:02:08,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-13 15:02:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:08,343 INFO L225 Difference]: With dead ends: 105 [2022-07-13 15:02:08,343 INFO L226 Difference]: Without dead ends: 86 [2022-07-13 15:02:08,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:02:08,344 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:08,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 132 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-13 15:02:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2022-07-13 15:02:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-07-13 15:02:08,348 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2022-07-13 15:02:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:08,349 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-07-13 15:02:08,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-07-13 15:02:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:02:08,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:08,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:08,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 15:02:08,349 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:08,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:08,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2051498108, now seen corresponding path program 1 times [2022-07-13 15:02:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:08,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327935120] [2022-07-13 15:02:08,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:08,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:08,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:08,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327935120] [2022-07-13 15:02:08,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327935120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:08,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:08,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:02:08,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141386700] [2022-07-13 15:02:08,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:08,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:02:08,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:08,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:02:08,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:08,392 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:08,510 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-07-13 15:02:08,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:02:08,511 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 [2022-07-13 15:02:08,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:08,511 INFO L225 Difference]: With dead ends: 84 [2022-07-13 15:02:08,511 INFO L226 Difference]: Without dead ends: 82 [2022-07-13 15:02:08,512 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 [2022-07-13 15:02:08,512 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:08,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 110 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:08,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-13 15:02:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 48. [2022-07-13 15:02:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-07-13 15:02:08,522 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2022-07-13 15:02:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:08,522 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-07-13 15:02:08,523 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) [2022-07-13 15:02:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-07-13 15:02:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:02:08,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:08,524 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:08,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 15:02:08,524 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:08,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1690516158, now seen corresponding path program 1 times [2022-07-13 15:02:08,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:08,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229263489] [2022-07-13 15:02:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:08,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:08,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:08,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229263489] [2022-07-13 15:02:08,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229263489] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:08,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744067528] [2022-07-13 15:02:08,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:08,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:08,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:08,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:08,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:02:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:08,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-13 15:02:08,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:08,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:02:08,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:08,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 15:02:09,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 15:02:09,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-13 15:02:09,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2022-07-13 15:02:09,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-07-13 15:02:09,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-13 15:02:09,055 INFO L356 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-07-13 15:02:09,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2022-07-13 15:02:09,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-13 15:02:09,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 45 [2022-07-13 15:02:09,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,184 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-13 15:02:09,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 15:02:09,208 INFO L356 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-07-13 15:02:09,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 15:02:09,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:09,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2022-07-13 15:02:09,250 INFO L356 Elim1Store]: treesize reduction 70, result has 35.8 percent of original size [2022-07-13 15:02:09,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 15:02:09,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-13 15:02:09,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:09,396 INFO L356 Elim1Store]: treesize reduction 174, result has 19.1 percent of original size [2022-07-13 15:02:09,397 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:02:09,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 15:02:09,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:09,612 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_54| input size 85 context size 85 output size 85 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 15:02:09,615 INFO L158 Benchmark]: Toolchain (without parser) took 3637.75ms. Allocated memory was 86.0MB in the beginning and 136.3MB in the end (delta: 50.3MB). Free memory was 54.5MB in the beginning and 102.9MB in the end (delta: -48.4MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2022-07-13 15:02:09,616 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory is still 44.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:02:09,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.13ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 54.5MB in the beginning and 82.7MB in the end (delta: -28.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:02:09,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.41ms. Allocated memory is still 113.2MB. Free memory was 82.7MB in the beginning and 80.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:02:09,616 INFO L158 Benchmark]: Boogie Preprocessor took 20.73ms. Allocated memory is still 113.2MB. Free memory was 80.6MB in the beginning and 79.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:02:09,616 INFO L158 Benchmark]: RCFGBuilder took 412.27ms. Allocated memory is still 113.2MB. Free memory was 79.2MB in the beginning and 61.7MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 15:02:09,617 INFO L158 Benchmark]: TraceAbstraction took 2847.44ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 61.0MB in the beginning and 102.9MB in the end (delta: -41.9MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2022-07-13 15:02:09,618 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory is still 44.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.13ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 54.5MB in the beginning and 82.7MB in the end (delta: -28.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.41ms. Allocated memory is still 113.2MB. Free memory was 82.7MB in the beginning and 80.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.73ms. Allocated memory is still 113.2MB. Free memory was 80.6MB in the beginning and 79.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 412.27ms. Allocated memory is still 113.2MB. Free memory was 79.2MB in the beginning and 61.7MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2847.44ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 61.0MB in the beginning and 102.9MB in the end (delta: -41.9MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_54| input size 85 context size 85 output size 85 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_54| input size 85 context size 85 output size 85: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 15:02:09,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_Bitvector.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-?-f4b24e3 [2022-07-13 15:02:11,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:02:11,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:02:11,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:02:11,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:02:11,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:02:11,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:02:11,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:02:11,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:02:11,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:02:11,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:02:11,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:02:11,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:02:11,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:02:11,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:02:11,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:02:11,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:02:11,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:02:11,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:02:11,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:02:11,357 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:02:11,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:02:11,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:02:11,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:02:11,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:02:11,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:02:11,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:02:11,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:02:11,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:02:11,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:02:11,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:02:11,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:02:11,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:02:11,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:02:11,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:02:11,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:02:11,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:02:11,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:02:11,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:02:11,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:02:11,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:02:11,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:02:11,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 15:02:11,404 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:02:11,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:02:11,404 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:02:11,405 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:02:11,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:02:11,405 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:02:11,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:02:11,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:02:11,407 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:02:11,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:02:11,418 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:02:11,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:02:11,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:02:11,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:02:11,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:02:11,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:02:11,419 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 15:02:11,419 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 15:02:11,420 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 15:02:11,420 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:02:11,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:02:11,420 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:02:11,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:02:11,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:02:11,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:02:11,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:02:11,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:11,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:02:11,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:02:11,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:02:11,422 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 15:02:11,422 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 15:02:11,422 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:02:11,422 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:02:11,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:02:11,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 15:02:11,423 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 [2022-07-13 15:02:11,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:02:11,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:02:11,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:02:11,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:02:11,699 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:02:11,700 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 [2022-07-13 15:02:11,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4766f5053/2ecc29ffb8354cfd83b4d61db8e797e1/FLAG78885b5aa [2022-07-13 15:02:12,136 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:02:12,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2022-07-13 15:02:12,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4766f5053/2ecc29ffb8354cfd83b4d61db8e797e1/FLAG78885b5aa [2022-07-13 15:02:12,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4766f5053/2ecc29ffb8354cfd83b4d61db8e797e1 [2022-07-13 15:02:12,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:02:12,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:02:12,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:12,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:02:12,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:02:12,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:12" (1/1) ... [2022-07-13 15:02:12,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f4183f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12, skipping insertion in model container [2022-07-13 15:02:12,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:12" (1/1) ... [2022-07-13 15:02:12,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:02:12,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:02:12,488 WARN L230 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] [2022-07-13 15:02:12,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:12,508 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:02:12,540 WARN L230 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] [2022-07-13 15:02:12,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:12,568 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:02:12,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12 WrapperNode [2022-07-13 15:02:12,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:12,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:12,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:02:12,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:02:12,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12" (1/1) ... [2022-07-13 15:02:12,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12" (1/1) ... [2022-07-13 15:02:12,615 INFO L137 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2022-07-13 15:02:12,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:12,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:02:12,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:02:12,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:02:12,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12" (1/1) ... [2022-07-13 15:02:12,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12" (1/1) ... [2022-07-13 15:02:12,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12" (1/1) ... [2022-07-13 15:02:12,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12" (1/1) ... [2022-07-13 15:02:12,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12" (1/1) ... [2022-07-13 15:02:12,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12" (1/1) ... [2022-07-13 15:02:12,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12" (1/1) ... [2022-07-13 15:02:12,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:02:12,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:02:12,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:02:12,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:02:12,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12" (1/1) ... [2022-07-13 15:02:12,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:12,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:12,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:02:12,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:02:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 15:02:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:02:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:02:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:02:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:02:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:02:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 15:02:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 15:02:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:02:12,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:02:12,789 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:02:12,790 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:02:13,191 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:02:13,195 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:02:13,196 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-13 15:02:13,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:13 BoogieIcfgContainer [2022-07-13 15:02:13,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:02:13,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:02:13,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:02:13,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:02:13,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:02:12" (1/3) ... [2022-07-13 15:02:13,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77eb55b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:13, skipping insertion in model container [2022-07-13 15:02:13,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:12" (2/3) ... [2022-07-13 15:02:13,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77eb55b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:13, skipping insertion in model container [2022-07-13 15:02:13,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:13" (3/3) ... [2022-07-13 15:02:13,204 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2022-07-13 15:02:13,214 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:02:13,214 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:02:13,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:02:13,247 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fd9479a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a1bb3ee [2022-07-13 15:02:13,247 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:02:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:02:13,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:13,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:13,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1712561739, now seen corresponding path program 1 times [2022-07-13 15:02:13,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:13,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037356612] [2022-07-13 15:02:13,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:13,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:13,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:13,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:13,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 15:02:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:13,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 15:02:13,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:13,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:13,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:13,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037356612] [2022-07-13 15:02:13,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037356612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:13,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:13,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:02:13,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992160483] [2022-07-13 15:02:13,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:13,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:02:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:13,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:02:13,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:02:13,431 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 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) [2022-07-13 15:02:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:13,441 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-07-13 15:02:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:02:13,442 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 [2022-07-13 15:02:13,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:13,447 INFO L225 Difference]: With dead ends: 50 [2022-07-13 15:02:13,447 INFO L226 Difference]: Without dead ends: 21 [2022-07-13 15:02:13,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:02:13,452 INFO L413 NwaCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:13,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-13 15:02:13,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-13 15:02:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:13,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-07-13 15:02:13,471 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 15 [2022-07-13 15:02:13,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:13,471 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-07-13 15:02:13,471 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) [2022-07-13 15:02:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-07-13 15:02:13,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:02:13,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:13,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:13,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 15:02:13,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:13,674 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:13,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1397938948, now seen corresponding path program 1 times [2022-07-13 15:02:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:13,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89852029] [2022-07-13 15:02:13,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:13,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:13,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:13,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:13,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 15:02:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:13,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:02:13,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:13,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:13,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:13,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89852029] [2022-07-13 15:02:13,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89852029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:13,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:13,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:13,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238464891] [2022-07-13 15:02:13,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:13,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:13,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:13,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:13,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:13,788 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2022-07-13 15:02:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:13,809 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2022-07-13 15:02:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:13,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 [2022-07-13 15:02:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:13,810 INFO L225 Difference]: With dead ends: 24 [2022-07-13 15:02:13,810 INFO L226 Difference]: Without dead ends: 22 [2022-07-13 15:02:13,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:13,811 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:13,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-13 15:02:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-13 15:02:13,813 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) [2022-07-13 15:02:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-07-13 15:02:13,814 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2022-07-13 15:02:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:13,814 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-13 15:02:13,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2022-07-13 15:02:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-07-13 15:02:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:02:13,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:13,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:13,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:14,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:14,015 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:14,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:14,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1397937026, now seen corresponding path program 1 times [2022-07-13 15:02:14,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:14,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897141484] [2022-07-13 15:02:14,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:14,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:14,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:14,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:14,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 15:02:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:14,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 15:02:14,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:14,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:02:14,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:14,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:14,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 15:02:14,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:14,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2022-07-13 15:02:14,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:14,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-07-13 15:02:14,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-13 15:02:14,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-13 15:02:14,303 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-13 15:02:14,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-13 15:02:14,500 INFO L356 Elim1Store]: treesize reduction 35, result has 7.9 percent of original size [2022-07-13 15:02:14,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 62 [2022-07-13 15:02:14,516 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:02:14,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 26 [2022-07-13 15:02:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:14,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:14,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:14,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897141484] [2022-07-13 15:02:14,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897141484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:14,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:14,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:02:14,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14721362] [2022-07-13 15:02:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:14,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:02:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:14,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:02:14,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:02:14,542 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) [2022-07-13 15:02:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:15,540 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-07-13 15:02:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 15:02:15,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 [2022-07-13 15:02:15,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:15,541 INFO L225 Difference]: With dead ends: 67 [2022-07-13 15:02:15,541 INFO L226 Difference]: Without dead ends: 54 [2022-07-13 15:02:15,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-13 15:02:15,543 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 89 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:15,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 68 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 15:02:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-13 15:02:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 32. [2022-07-13 15:02:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-07-13 15:02:15,548 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 15 [2022-07-13 15:02:15,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:15,548 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-07-13 15:02:15,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) [2022-07-13 15:02:15,549 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-07-13 15:02:15,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:02:15,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:15,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:15,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:15,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:15,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:15,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:15,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1396089984, now seen corresponding path program 1 times [2022-07-13 15:02:15,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:15,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540984726] [2022-07-13 15:02:15,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:15,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:15,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:15,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:15,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 15:02:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:15,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 15:02:15,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:16,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:16,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:16,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540984726] [2022-07-13 15:02:16,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540984726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:16,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:16,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 15:02:16,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015660509] [2022-07-13 15:02:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:16,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:02:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:02:16,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:02:16,015 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) [2022-07-13 15:02:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:17,113 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-07-13 15:02:17,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 15:02:17,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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 [2022-07-13 15:02:17,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:17,115 INFO L225 Difference]: With dead ends: 65 [2022-07-13 15:02:17,115 INFO L226 Difference]: Without dead ends: 63 [2022-07-13 15:02:17,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-07-13 15:02:17,116 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 77 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:17,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 62 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 15:02:17,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-13 15:02:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2022-07-13 15:02:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.4) internal successors, (56), 40 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2022-07-13 15:02:17,122 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 15 [2022-07-13 15:02:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:17,122 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2022-07-13 15:02:17,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) [2022-07-13 15:02:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-07-13 15:02:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:02:17,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:17,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:17,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:17,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:17,324 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:17,325 INFO L85 PathProgramCache]: Analyzing trace with hash 378917378, now seen corresponding path program 1 times [2022-07-13 15:02:17,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:17,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760813838] [2022-07-13 15:02:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:17,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:17,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:17,326 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:17,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 15:02:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:17,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 15:02:17,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:17,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:02:17,434 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 15:02:17,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-13 15:02:17,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:17,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 15:02:17,461 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:02:17,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 15:02:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:17,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:17,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:17,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760813838] [2022-07-13 15:02:17,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760813838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:17,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:17,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:02:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730944312] [2022-07-13 15:02:17,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:17,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:02:17,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:17,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:02:17,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:02:17,497 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2022-07-13 15:02:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:18,021 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2022-07-13 15:02:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:02:18,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 [2022-07-13 15:02:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:18,022 INFO L225 Difference]: With dead ends: 74 [2022-07-13 15:02:18,022 INFO L226 Difference]: Without dead ends: 57 [2022-07-13 15:02:18,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:02:18,023 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 71 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:18,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 69 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 15:02:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-13 15:02:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2022-07-13 15:02:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-07-13 15:02:18,028 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 15 [2022-07-13 15:02:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:18,028 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-07-13 15:02:18,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2022-07-13 15:02:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-07-13 15:02:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:02:18,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:18,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:18,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-13 15:02:18,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:18,237 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:18,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:18,238 INFO L85 PathProgramCache]: Analyzing trace with hash -513797694, now seen corresponding path program 1 times [2022-07-13 15:02:18,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:18,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615669715] [2022-07-13 15:02:18,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:18,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:18,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:18,242 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:18,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 15:02:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:18,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 15:02:18,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:18,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:18,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:18,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:18,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:18,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615669715] [2022-07-13 15:02:18,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615669715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:18,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:18,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:02:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360304764] [2022-07-13 15:02:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:18,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:02:18,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:18,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:02:18,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:02:18,405 INFO L87 Difference]: Start difference. First operand 39 states and 52 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) [2022-07-13 15:02:19,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:19,538 INFO L93 Difference]: Finished difference Result 106 states and 143 transitions. [2022-07-13 15:02:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:02:19,542 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 [2022-07-13 15:02:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:19,542 INFO L225 Difference]: With dead ends: 106 [2022-07-13 15:02:19,543 INFO L226 Difference]: Without dead ends: 93 [2022-07-13 15:02:19,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-07-13 15:02:19,543 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 80 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:19,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 132 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 15:02:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-13 15:02:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 48. [2022-07-13 15:02:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2022-07-13 15:02:19,550 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 16 [2022-07-13 15:02:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:19,550 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2022-07-13 15:02:19,550 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) [2022-07-13 15:02:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-07-13 15:02:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:02:19,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:19,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:19,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:19,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:19,759 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:19,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1263056710, now seen corresponding path program 1 times [2022-07-13 15:02:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:19,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336830565] [2022-07-13 15:02:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:19,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:19,762 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:19,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 15:02:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:19,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 15:02:19,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:19,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:19,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:19,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:19,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:19,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336830565] [2022-07-13 15:02:19,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336830565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:19,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:19,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:02:19,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862494318] [2022-07-13 15:02:19,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:19,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:02:19,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:19,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:02:19,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:02:19,903 INFO L87 Difference]: Start difference. First operand 48 states and 63 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) [2022-07-13 15:02:20,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:20,849 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-07-13 15:02:20,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:02:20,850 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 [2022-07-13 15:02:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:20,850 INFO L225 Difference]: With dead ends: 78 [2022-07-13 15:02:20,850 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 15:02:20,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:02:20,851 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 56 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:20,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 92 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 15:02:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 15:02:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 48. [2022-07-13 15:02:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2022-07-13 15:02:20,856 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 16 [2022-07-13 15:02:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:20,856 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2022-07-13 15:02:20,857 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) [2022-07-13 15:02:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-07-13 15:02:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:02:20,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:20,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:20,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:21,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:21,058 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:02:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:21,058 INFO L85 PathProgramCache]: Analyzing trace with hash -871782213, now seen corresponding path program 1 times [2022-07-13 15:02:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:21,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118347938] [2022-07-13 15:02:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:21,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:21,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:21,060 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:21,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 15:02:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:21,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-13 15:02:21,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:21,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:02:21,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:21,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2022-07-13 15:02:21,341 INFO L356 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2022-07-13 15:02:21,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2022-07-13 15:02:21,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-07-13 15:02:21,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:21,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:21,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:21,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2022-07-13 15:02:21,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:21,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:21,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:21,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:21,491 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 15:02:21,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 62 [2022-07-13 15:02:21,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:21,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:21,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2022-07-13 15:02:21,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:21,525 INFO L356 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-07-13 15:02:21,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 66 [2022-07-13 15:02:21,563 INFO L356 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2022-07-13 15:02:21,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 54 [2022-07-13 15:02:21,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 15:02:21,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 15:02:21,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:21,863 INFO L356 Elim1Store]: treesize reduction 166, result has 22.8 percent of original size [2022-07-13 15:02:21,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:21,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118347938] [2022-07-13 15:02:21,865 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:02:21,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-13 15:02:22,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:22,066 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_55| input size 87 context size 87 output size 87 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 15:02:22,069 INFO L158 Benchmark]: Toolchain (without parser) took 9898.21ms. Allocated memory was 65.0MB in the beginning and 104.9MB in the end (delta: 39.8MB). Free memory was 43.9MB in the beginning and 74.3MB in the end (delta: -30.4MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2022-07-13 15:02:22,069 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 65.0MB. Free memory was 46.5MB in the beginning and 46.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:02:22,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.96ms. Allocated memory is still 65.0MB. Free memory was 43.6MB in the beginning and 40.1MB in the end (delta: 3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 15:02:22,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.41ms. Allocated memory is still 65.0MB. Free memory was 39.9MB in the beginning and 37.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:02:22,070 INFO L158 Benchmark]: Boogie Preprocessor took 33.18ms. Allocated memory is still 65.0MB. Free memory was 37.8MB in the beginning and 35.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:02:22,070 INFO L158 Benchmark]: RCFGBuilder took 545.27ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 35.7MB in the beginning and 59.3MB in the end (delta: -23.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-07-13 15:02:22,070 INFO L158 Benchmark]: TraceAbstraction took 8869.42ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 58.9MB in the beginning and 74.3MB in the end (delta: -15.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2022-07-13 15:02:22,071 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 65.0MB. Free memory was 46.5MB in the beginning and 46.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.96ms. Allocated memory is still 65.0MB. Free memory was 43.6MB in the beginning and 40.1MB in the end (delta: 3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.41ms. Allocated memory is still 65.0MB. Free memory was 39.9MB in the beginning and 37.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.18ms. Allocated memory is still 65.0MB. Free memory was 37.8MB in the beginning and 35.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.27ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 35.7MB in the beginning and 59.3MB in the end (delta: -23.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8869.42ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 58.9MB in the beginning and 74.3MB in the end (delta: -15.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_55| input size 87 context size 87 output size 87 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_55| input size 87 context size 87 output size 87: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 15:02:22,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_55| input size 87 context size 87 output size 87