./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/shared_mem1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/heap-data/shared_mem1.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 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:46:44,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:46:44,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:46:44,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:46:44,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:46:44,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:46:44,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:46:44,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:46:44,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:46:44,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:46:44,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:46:44,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:46:44,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:46:44,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:46:44,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:46:44,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:46:44,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:46:44,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:46:44,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:46:44,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:46:44,409 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:46:44,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:46:44,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:46:44,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:46:44,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:46:44,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:46:44,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:46:44,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:46:44,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:46:44,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:46:44,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:46:44,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:46:44,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:46:44,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:46:44,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:46:44,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:46:44,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:46:44,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:46:44,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:46:44,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:46:44,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:46:44,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:46:44,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:46:44,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:46:44,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:46:44,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:46:44,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:46:44,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:46:44,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:46:44,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:46:44,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:46:44,455 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:46:44,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:46:44,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:46:44,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:46:44,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:46:44,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:46:44,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:46:44,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:46:44,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:46:44,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:46:44,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:46:44,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:46:44,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:46:44,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:46:44,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:46:44,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:46:44,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:46:44,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:46:44,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:46:44,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:46:44,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:46:44,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:46:44,460 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:46:44,460 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:46:44,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:46:44,460 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 -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2022-07-19 14:46:44,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:46:44,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:46:44,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:46:44,689 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:46:44,689 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:46:44,690 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-19 14:46:44,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1f90236/77e40ba3037a4c8f9320f355ba3bb28b/FLAG701058a57 [2022-07-19 14:46:45,103 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:46:45,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-19 14:46:45,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1f90236/77e40ba3037a4c8f9320f355ba3bb28b/FLAG701058a57 [2022-07-19 14:46:45,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1f90236/77e40ba3037a4c8f9320f355ba3bb28b [2022-07-19 14:46:45,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:46:45,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:46:45,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:46:45,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:46:45,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:46:45,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:46:45" (1/1) ... [2022-07-19 14:46:45,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a341854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45, skipping insertion in model container [2022-07-19 14:46:45,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:46:45" (1/1) ... [2022-07-19 14:46:45,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:46:45,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:46:45,759 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/heap-data/shared_mem1.i[23879,23892] [2022-07-19 14:46:45,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:46:45,766 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:46:45,798 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/heap-data/shared_mem1.i[23879,23892] [2022-07-19 14:46:45,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:46:45,823 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:46:45,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45 WrapperNode [2022-07-19 14:46:45,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:46:45,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:46:45,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:46:45,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:46:45,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45" (1/1) ... [2022-07-19 14:46:45,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45" (1/1) ... [2022-07-19 14:46:45,875 INFO L137 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-07-19 14:46:45,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:46:45,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:46:45,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:46:45,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:46:45,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45" (1/1) ... [2022-07-19 14:46:45,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45" (1/1) ... [2022-07-19 14:46:45,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45" (1/1) ... [2022-07-19 14:46:45,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45" (1/1) ... [2022-07-19 14:46:45,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45" (1/1) ... [2022-07-19 14:46:45,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45" (1/1) ... [2022-07-19 14:46:45,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45" (1/1) ... [2022-07-19 14:46:45,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:46:45,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:46:45,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:46:45,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:46:45,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45" (1/1) ... [2022-07-19 14:46:45,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:46:45,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:45,942 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-19 14:46:45,947 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-19 14:46:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:46:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:46:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:46:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:46:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:46:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:46:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:46:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:46:45,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:46:46,074 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:46:46,075 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:46:46,303 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:46:46,307 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:46:46,308 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 14:46:46,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:46:46 BoogieIcfgContainer [2022-07-19 14:46:46,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:46:46,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:46:46,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:46:46,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:46:46,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:46:45" (1/3) ... [2022-07-19 14:46:46,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c76ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:46:46, skipping insertion in model container [2022-07-19 14:46:46,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:45" (2/3) ... [2022-07-19 14:46:46,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c76ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:46:46, skipping insertion in model container [2022-07-19 14:46:46,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:46:46" (3/3) ... [2022-07-19 14:46:46,314 INFO L111 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2022-07-19 14:46:46,323 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:46:46,326 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:46:46,366 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:46:46,371 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@51381d1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1cf3c322 [2022-07-19 14:46:46,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:46:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 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-19 14:46:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 14:46:46,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:46,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:46,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1650103796, now seen corresponding path program 1 times [2022-07-19 14:46:46,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:46,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778129231] [2022-07-19 14:46:46,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:46,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:46,575 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-19 14:46:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:46,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778129231] [2022-07-19 14:46:46,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778129231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:46:46,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:46:46,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:46:46,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671136476] [2022-07-19 14:46:46,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:46:46,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:46:46,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:46,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:46:46,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:46:46,606 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-19 14:46:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:46,615 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-07-19 14:46:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:46:46,617 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-07-19 14:46:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:46,621 INFO L225 Difference]: With dead ends: 27 [2022-07-19 14:46:46,621 INFO L226 Difference]: Without dead ends: 13 [2022-07-19 14:46:46,624 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-19 14:46:46,627 INFO L413 NwaCegarLoop]: 20 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, 20 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-19 14:46:46,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:46:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-19 14:46:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-19 14:46:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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-19 14:46:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-07-19 14:46:46,646 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2022-07-19 14:46:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:46,647 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-07-19 14:46:46,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-19 14:46:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-07-19 14:46:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 14:46:46,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:46,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:46,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:46:46,648 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:46,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash -812668617, now seen corresponding path program 1 times [2022-07-19 14:46:46,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:46,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869109814] [2022-07-19 14:46:46,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:46,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:46,972 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-19 14:46:46,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:46,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869109814] [2022-07-19 14:46:46,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869109814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:46:46,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:46:46,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 14:46:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314346779] [2022-07-19 14:46:46,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:46:46,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:46:46,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:46,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:46:46,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:46:46,975 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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-19 14:46:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:47,129 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-07-19 14:46:47,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:46:47,130 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-19 14:46:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:47,131 INFO L225 Difference]: With dead ends: 29 [2022-07-19 14:46:47,131 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 14:46:47,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:46:47,141 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:47,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:46:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 14:46:47,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-19 14:46:47,146 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-19 14:46:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-07-19 14:46:47,146 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 11 [2022-07-19 14:46:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:47,147 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-19 14:46:47,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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-19 14:46:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-07-19 14:46:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 14:46:47,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:47,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:47,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:46:47,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:47,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:47,149 INFO L85 PathProgramCache]: Analyzing trace with hash -812666695, now seen corresponding path program 1 times [2022-07-19 14:46:47,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:47,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266554520] [2022-07-19 14:46:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:47,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:47,310 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-19 14:46:47,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:47,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266554520] [2022-07-19 14:46:47,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266554520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:46:47,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:46:47,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:46:47,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409389980] [2022-07-19 14:46:47,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:46:47,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:46:47,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:47,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:46:47,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:46:47,313 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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-19 14:46:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:47,407 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-07-19 14:46:47,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:46:47,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-19 14:46:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:47,408 INFO L225 Difference]: With dead ends: 31 [2022-07-19 14:46:47,408 INFO L226 Difference]: Without dead ends: 24 [2022-07-19 14:46:47,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:46:47,409 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:47,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 38 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:46:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-19 14:46:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-07-19 14:46:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 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-19 14:46:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-07-19 14:46:47,413 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 11 [2022-07-19 14:46:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:47,413 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-19 14:46:47,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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-19 14:46:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-07-19 14:46:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 14:46:47,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:47,413 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:47,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:46:47,414 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1760681901, now seen corresponding path program 1 times [2022-07-19 14:46:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:47,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711113859] [2022-07-19 14:46:47,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:47,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:47,601 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-19 14:46:47,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:47,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711113859] [2022-07-19 14:46:47,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711113859] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:47,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12065083] [2022-07-19 14:46:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:47,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:47,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:47,604 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-19 14:46:47,631 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-19 14:46:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:47,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-19 14:46:47,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:47,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:47,823 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 18 treesize of output 19 [2022-07-19 14:46:47,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:47,849 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 18 treesize of output 19 [2022-07-19 14:46:47,862 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:46:47,862 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-19 14:46:47,903 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-07-19 14:46:47,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 94 [2022-07-19 14:46:47,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:47,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:47,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:47,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-19 14:46:47,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:47,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:47,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:47,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-07-19 14:46:47,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:47,987 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 72 treesize of output 41 [2022-07-19 14:46:47,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:47,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:47,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:47,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 26 [2022-07-19 14:46:48,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:48,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:48,119 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 26 treesize of output 23 [2022-07-19 14:46:48,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:48,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:48,128 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 26 treesize of output 23 [2022-07-19 14:46:48,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:48,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:48,135 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 24 treesize of output 21 [2022-07-19 14:46:48,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:48,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-19 14:46:48,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:48,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-07-19 14:46:48,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:48,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-19 14:46:48,159 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:46:48,160 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-19 14:46:48,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2022-07-19 14:46:48,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:46:48,277 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-19 14:46:48,278 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 42 [2022-07-19 14:46:48,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-19 14:46:48,385 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:46:48,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2022-07-19 14:46:48,397 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-19 14:46:48,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:48,651 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-19 14:46:48,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12065083] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:46:48,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:46:48,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-07-19 14:46:48,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477303058] [2022-07-19 14:46:48,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:48,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 14:46:48,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:48,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 14:46:48,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-19 14:46:48,654 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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-19 14:46:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:48,911 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-07-19 14:46:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:46:48,912 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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 14 [2022-07-19 14:46:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:48,913 INFO L225 Difference]: With dead ends: 47 [2022-07-19 14:46:48,913 INFO L226 Difference]: Without dead ends: 45 [2022-07-19 14:46:48,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-07-19 14:46:48,914 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 62 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:48,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 92 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 70 Unchecked, 0.0s Time] [2022-07-19 14:46:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-19 14:46:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2022-07-19 14:46:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:46:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2022-07-19 14:46:48,918 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 14 [2022-07-19 14:46:48,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:48,918 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2022-07-19 14:46:48,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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-19 14:46:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2022-07-19 14:46:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 14:46:48,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:48,919 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:48,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:46:49,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:49,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:49,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1760679979, now seen corresponding path program 1 times [2022-07-19 14:46:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:49,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943662228] [2022-07-19 14:46:49,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:49,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:49,297 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-19 14:46:49,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:49,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943662228] [2022-07-19 14:46:49,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943662228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:49,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574176065] [2022-07-19 14:46:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:49,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:49,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:49,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:46:49,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 14:46:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:49,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-19 14:46:49,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:49,423 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-19 14:46:49,423 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2022-07-19 14:46:49,446 INFO L356 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2022-07-19 14:46:49,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 91 [2022-07-19 14:46:49,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-19 14:46:49,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-07-19 14:46:49,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 75 treesize of output 53 [2022-07-19 14:46:49,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 121 [2022-07-19 14:46:49,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:46:49,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2022-07-19 14:46:49,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-07-19 14:46:49,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 26 [2022-07-19 14:46:49,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,601 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 18 treesize of output 19 [2022-07-19 14:46:49,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,607 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 18 treesize of output 19 [2022-07-19 14:46:49,624 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:46:49,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 14:46:49,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-19 14:46:49,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-19 14:46:49,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,756 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 31 treesize of output 31 [2022-07-19 14:46:49,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-19 14:46:49,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-07-19 14:46:49,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:49,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-19 14:46:49,798 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 14:46:49,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 14:46:49,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2022-07-19 14:46:49,902 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2022-07-19 14:46:49,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-19 14:46:49,944 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:46:49,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2022-07-19 14:46:49,949 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-19 14:46:49,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:50,184 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-19 14:46:50,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574176065] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:46:50,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:46:50,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-07-19 14:46:50,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17648552] [2022-07-19 14:46:50,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:50,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 14:46:50,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:50,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 14:46:50,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=180, Unknown=2, NotChecked=0, Total=240 [2022-07-19 14:46:50,191 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 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-19 14:46:50,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:50,363 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-07-19 14:46:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:46:50,364 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 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 14 [2022-07-19 14:46:50,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:50,364 INFO L225 Difference]: With dead ends: 44 [2022-07-19 14:46:50,364 INFO L226 Difference]: Without dead ends: 34 [2022-07-19 14:46:50,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=245, Unknown=2, NotChecked=0, Total=342 [2022-07-19 14:46:50,365 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:50,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 28 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-07-19 14:46:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-19 14:46:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-07-19 14:46:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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-19 14:46:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-19 14:46:50,368 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2022-07-19 14:46:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:50,368 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-19 14:46:50,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 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-19 14:46:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-19 14:46:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 14:46:50,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:50,369 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:50,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:46:50,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:50,579 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash 187961508, now seen corresponding path program 1 times [2022-07-19 14:46:50,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:50,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36202374] [2022-07-19 14:46:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:50,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:50,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36202374] [2022-07-19 14:46:50,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36202374] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:50,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593128911] [2022-07-19 14:46:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:50,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:50,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:50,792 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:46:50,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 14:46:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:50,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-19 14:46:50,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:50,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:50,883 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 18 treesize of output 19 [2022-07-19 14:46:50,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:50,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:50,902 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 29 treesize of output 33 [2022-07-19 14:46:50,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:50,908 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 30 treesize of output 30 [2022-07-19 14:46:50,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:50,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:50,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:50,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-19 14:46:50,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:50,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:50,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:46:50,923 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-19 14:46:50,926 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 16 treesize of output 14 [2022-07-19 14:46:51,023 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:46:51,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 102 [2022-07-19 14:46:51,027 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 38 [2022-07-19 14:46:51,030 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 56 treesize of output 54 [2022-07-19 14:46:51,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-07-19 14:46:51,129 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:46:51,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-07-19 14:46:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:46:51,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:46:51,194 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_514 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse0 (select |c_#memory_int| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (or (not (<= (+ (select .cse0 .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_514)) (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_516)) (.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_515)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse5 (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)))) (select (select (store |c_#memory_int| .cse2 (store .cse0 .cse1 v_ArrVal_514)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))))) is different from false [2022-07-19 14:46:51,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_514 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (or (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_516)) (.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_515)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse5 (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)))) (select (select (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_514)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (<= (+ (select .cse1 .cse2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_514))))))) is different from false [2022-07-19 14:46:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-19 14:46:51,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593128911] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:46:51,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:46:51,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 7] total 18 [2022-07-19 14:46:51,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345940852] [2022-07-19 14:46:51,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:46:51,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 14:46:51,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:46:51,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 14:46:51,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=206, Unknown=2, NotChecked=58, Total=306 [2022-07-19 14:46:51,237 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 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-19 14:46:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:51,896 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-07-19 14:46:51,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:46:51,896 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 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-19 14:46:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:51,897 INFO L225 Difference]: With dead ends: 52 [2022-07-19 14:46:51,897 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 14:46:51,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=356, Unknown=2, NotChecked=82, Total=552 [2022-07-19 14:46:51,898 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:51,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 115 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 125 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2022-07-19 14:46:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 14:46:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-19 14:46:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-19 14:46:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-07-19 14:46:51,901 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 16 [2022-07-19 14:46:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:51,901 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-19 14:46:51,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 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-19 14:46:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-07-19 14:46:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 14:46:51,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:51,902 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:51,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:46:52,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:52,112 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:52,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash -319487049, now seen corresponding path program 2 times [2022-07-19 14:46:52,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:46:52,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688588558] [2022-07-19 14:46:52,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:52,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:46:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:46:52,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:46:52,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688588558] [2022-07-19 14:46:52,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688588558] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:46:52,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833390897] [2022-07-19 14:46:52,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:46:52,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:52,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:52,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:46:52,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 14:46:52,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:46:52,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:46:52,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-19 14:46:52,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:52,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,437 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 18 treesize of output 19 [2022-07-19 14:46:52,446 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:46:52,447 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-19 14:46:52,484 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-07-19 14:46:52,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 94 [2022-07-19 14:46:52,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-19 14:46:52,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-07-19 14:46:52,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:46:52,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 36 [2022-07-19 14:46:52,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 26 [2022-07-19 14:46:52,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,569 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 18 treesize of output 19 [2022-07-19 14:46:52,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,687 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-19 14:46:52,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,694 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-19 14:46:52,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:52,737 INFO L356 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2022-07-19 14:46:52,738 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 97 [2022-07-19 14:46:52,742 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:46:52,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 14:46:52,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:46:52,948 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) 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:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) 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:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) 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-19 14:46:52,951 INFO L158 Benchmark]: Toolchain (without parser) took 7482.54ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 55.3MB in the beginning and 134.3MB in the end (delta: -79.0MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2022-07-19 14:46:52,951 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:46:52,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.02ms. Allocated memory is still 94.4MB. Free memory was 55.1MB in the beginning and 64.3MB in the end (delta: -9.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 14:46:52,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.97ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 62.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:46:52,951 INFO L158 Benchmark]: Boogie Preprocessor took 35.26ms. Allocated memory is still 94.4MB. Free memory was 62.4MB in the beginning and 61.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:46:52,951 INFO L158 Benchmark]: RCFGBuilder took 397.05ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 46.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 14:46:52,952 INFO L158 Benchmark]: TraceAbstraction took 6640.18ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 45.9MB in the beginning and 134.3MB in the end (delta: -88.4MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2022-07-19 14:46:52,952 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.16ms. Allocated memory is still 94.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.02ms. Allocated memory is still 94.4MB. Free memory was 55.1MB in the beginning and 64.3MB in the end (delta: -9.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.97ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 62.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.26ms. Allocated memory is still 94.4MB. Free memory was 62.4MB in the beginning and 61.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 397.05ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 46.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6640.18ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 45.9MB in the beginning and 134.3MB in the end (delta: -88.4MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 14:46:52,981 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 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/heap-data/shared_mem1.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 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:46:54,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:46:54,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:46:54,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:46:54,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:46:54,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:46:54,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:46:54,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:46:54,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:46:54,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:46:54,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:46:54,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:46:54,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:46:54,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:46:54,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:46:54,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:46:54,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:46:54,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:46:54,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:46:54,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:46:54,942 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:46:54,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:46:54,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:46:54,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:46:54,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:46:54,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:46:54,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:46:54,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:46:54,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:46:54,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:46:54,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:46:54,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:46:54,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:46:54,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:46:54,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:46:54,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:46:54,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:46:54,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:46:54,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:46:54,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:46:54,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:46:54,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:46:54,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:46:54,997 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:46:54,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:46:54,997 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:46:54,997 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:46:54,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:46:54,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:46:54,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:46:54,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:46:54,999 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:46:54,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:46:55,000 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:46:55,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:46:55,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:46:55,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:46:55,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:46:55,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:46:55,001 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:46:55,001 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:46:55,001 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:46:55,001 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:46:55,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:46:55,002 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:46:55,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:46:55,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:46:55,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:46:55,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:46:55,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:46:55,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:46:55,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:46:55,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:46:55,003 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:46:55,004 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:46:55,004 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:46:55,004 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:46:55,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:46:55,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:46:55,005 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 -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2022-07-19 14:46:55,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:46:55,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:46:55,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:46:55,295 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:46:55,301 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:46:55,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-19 14:46:55,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d985f39/98d2ae2bd9424968bb8d62b11f25cd64/FLAGe13003326 [2022-07-19 14:46:55,710 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:46:55,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-19 14:46:55,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d985f39/98d2ae2bd9424968bb8d62b11f25cd64/FLAGe13003326 [2022-07-19 14:46:56,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d985f39/98d2ae2bd9424968bb8d62b11f25cd64 [2022-07-19 14:46:56,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:46:56,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:46:56,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:46:56,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:46:56,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:46:56,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:46:56" (1/1) ... [2022-07-19 14:46:56,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1119c2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56, skipping insertion in model container [2022-07-19 14:46:56,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:46:56" (1/1) ... [2022-07-19 14:46:56,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:46:56,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:46:56,437 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/heap-data/shared_mem1.i[23879,23892] [2022-07-19 14:46:56,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:46:56,456 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:46:56,493 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/heap-data/shared_mem1.i[23879,23892] [2022-07-19 14:46:56,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:46:56,516 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:46:56,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56 WrapperNode [2022-07-19 14:46:56,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:46:56,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:46:56,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:46:56,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:46:56,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56" (1/1) ... [2022-07-19 14:46:56,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56" (1/1) ... [2022-07-19 14:46:56,556 INFO L137 Inliner]: procedures = 124, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2022-07-19 14:46:56,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:46:56,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:46:56,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:46:56,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:46:56,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56" (1/1) ... [2022-07-19 14:46:56,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56" (1/1) ... [2022-07-19 14:46:56,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56" (1/1) ... [2022-07-19 14:46:56,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56" (1/1) ... [2022-07-19 14:46:56,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56" (1/1) ... [2022-07-19 14:46:56,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56" (1/1) ... [2022-07-19 14:46:56,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56" (1/1) ... [2022-07-19 14:46:56,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:46:56,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:46:56,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:46:56,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:46:56,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56" (1/1) ... [2022-07-19 14:46:56,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:46:56,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:46:56,636 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-19 14:46:56,641 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-19 14:46:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:46:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:46:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:46:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:46:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:46:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 14:46:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:46:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:46:56,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:46:56,734 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:46:56,735 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:46:57,039 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:46:57,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:46:57,042 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 14:46:57,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:46:57 BoogieIcfgContainer [2022-07-19 14:46:57,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:46:57,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:46:57,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:46:57,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:46:57,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:46:56" (1/3) ... [2022-07-19 14:46:57,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab2e833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:46:57, skipping insertion in model container [2022-07-19 14:46:57,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:46:56" (2/3) ... [2022-07-19 14:46:57,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab2e833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:46:57, skipping insertion in model container [2022-07-19 14:46:57,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:46:57" (3/3) ... [2022-07-19 14:46:57,048 INFO L111 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2022-07-19 14:46:57,057 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:46:57,057 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:46:57,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:46:57,107 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@37868066, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1354738b [2022-07-19 14:46:57,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:46:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 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-19 14:46:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 14:46:57,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:57,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:57,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash -15033972, now seen corresponding path program 1 times [2022-07-19 14:46:57,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:46:57,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442799180] [2022-07-19 14:46:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:57,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:46:57,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:46:57,133 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-19 14:46:57,134 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-19 14:46:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:57,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:46:57,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:57,264 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-19 14:46:57,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:46:57,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:46:57,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442799180] [2022-07-19 14:46:57,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442799180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:46:57,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:46:57,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:46:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118590746] [2022-07-19 14:46:57,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:46:57,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:46:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:46:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:46:57,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:46:57,293 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-19 14:46:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:57,303 INFO L93 Difference]: Finished difference Result 26 states and 37 transitions. [2022-07-19 14:46:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:46:57,305 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-07-19 14:46:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:57,309 INFO L225 Difference]: With dead ends: 26 [2022-07-19 14:46:57,309 INFO L226 Difference]: Without dead ends: 12 [2022-07-19 14:46:57,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-19 14:46:57,314 INFO L413 NwaCegarLoop]: 19 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, 19 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-19 14:46:57,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:46:57,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-07-19 14:46:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-19 14:46:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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-19 14:46:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-07-19 14:46:57,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2022-07-19 14:46:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:57,342 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-07-19 14:46:57,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-19 14:46:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-07-19 14:46:57,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 14:46:57,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:57,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:57,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-19 14:46:57,554 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-19 14:46:57,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:57,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:57,555 INFO L85 PathProgramCache]: Analyzing trace with hash -263268138, now seen corresponding path program 1 times [2022-07-19 14:46:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:46:57,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156667515] [2022-07-19 14:46:57,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:57,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:46:57,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:46:57,568 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-19 14:46:57,569 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-19 14:46:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:57,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 14:46:57,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:57,750 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 14:46:57,751 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:46:57,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:57,759 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 18 treesize of output 19 [2022-07-19 14:46:57,828 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-07-19 14:46:57,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 94 [2022-07-19 14:46:57,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:57,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:57,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:57,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-19 14:46:57,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:57,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:57,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:57,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-07-19 14:46:57,970 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 68 treesize of output 37 [2022-07-19 14:46:57,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:57,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:57,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:57,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 32 treesize of output 22 [2022-07-19 14:46:58,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 50 [2022-07-19 14:46:58,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2022-07-19 14:46:58,197 INFO L356 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-07-19 14:46:58,197 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 43 [2022-07-19 14:46:58,372 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:46:58,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 39 [2022-07-19 14:46:58,397 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-19 14:46:58,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:46:58,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:46:58,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156667515] [2022-07-19 14:46:58,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156667515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:46:58,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:46:58,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 14:46:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297264565] [2022-07-19 14:46:58,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:46:58,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:46:58,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:46:58,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:46:58,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:46:58,400 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-19 14:46:58,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:58,940 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-07-19 14:46:58,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:46:58,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 10 [2022-07-19 14:46:58,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:58,941 INFO L225 Difference]: With dead ends: 22 [2022-07-19 14:46:58,941 INFO L226 Difference]: Without dead ends: 20 [2022-07-19 14:46:58,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:46:58,942 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:58,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 32 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 12 Unchecked, 0.5s Time] [2022-07-19 14:46:58,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-19 14:46:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-19 14:46:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:46:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2022-07-19 14:46:58,946 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 10 [2022-07-19 14:46:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:58,946 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-19 14:46:58,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-19 14:46:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2022-07-19 14:46:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 14:46:58,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:58,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:58,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-19 14:46:59,155 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-19 14:46:59,155 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:46:59,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:46:59,156 INFO L85 PathProgramCache]: Analyzing trace with hash -263266216, now seen corresponding path program 1 times [2022-07-19 14:46:59,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:46:59,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102184240] [2022-07-19 14:46:59,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:46:59,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:46:59,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:46:59,158 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-19 14:46:59,159 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-19 14:46:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:46:59,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 14:46:59,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:46:59,280 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 14:46:59,281 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:46:59,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:59,288 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 18 treesize of output 19 [2022-07-19 14:46:59,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:59,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:59,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:46:59,350 INFO L356 Elim1Store]: treesize reduction 80, result has 29.2 percent of original size [2022-07-19 14:46:59,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 59 [2022-07-19 14:46:59,375 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 11 treesize of output 9 [2022-07-19 14:46:59,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2022-07-19 14:46:59,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2022-07-19 14:46:59,503 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 36 treesize of output 23 [2022-07-19 14:46:59,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2022-07-19 14:46:59,545 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-19 14:46:59,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:46:59,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:46:59,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102184240] [2022-07-19 14:46:59,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102184240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:46:59,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:46:59,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 14:46:59,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291040483] [2022-07-19 14:46:59,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:46:59,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:46:59,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:46:59,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:46:59,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:46:59,547 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-19 14:46:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:46:59,927 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-07-19 14:46:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:46:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2022-07-19 14:46:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:46:59,928 INFO L225 Difference]: With dead ends: 27 [2022-07-19 14:46:59,928 INFO L226 Difference]: Without dead ends: 20 [2022-07-19 14:46:59,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:46:59,929 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:46:59,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 10 Unchecked, 0.3s Time] [2022-07-19 14:46:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-19 14:46:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-19 14:46:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:46:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-07-19 14:46:59,932 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 10 [2022-07-19 14:46:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:46:59,932 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-19 14:46:59,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-19 14:46:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-07-19 14:46:59,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 14:46:59,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:46:59,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:46:59,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-19 14:47:00,145 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-19 14:47:00,146 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:47:00,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:47:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash -261421096, now seen corresponding path program 1 times [2022-07-19 14:47:00,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:47:00,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005492115] [2022-07-19 14:47:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:00,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:47:00,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:47:00,148 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-19 14:47:00,150 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-19 14:47:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:00,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 14:47:00,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:47:00,276 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 14:47:00,276 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:47:00,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:00,287 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 18 treesize of output 19 [2022-07-19 14:47:00,291 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 0 case distinctions, treesize of input 26 treesize of output 20 [2022-07-19 14:47:00,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:00,296 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 20 treesize of output 22 [2022-07-19 14:47:00,301 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 17 treesize of output 15 [2022-07-19 14:47:00,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2022-07-19 14:47:00,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-19 14:47:00,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:47:00,362 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-19 14:47:00,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:47:00,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:47:00,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005492115] [2022-07-19 14:47:00,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005492115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:47:00,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:47:00,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:47:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352266348] [2022-07-19 14:47:00,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:47:00,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:47:00,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:47:00,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:47:00,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:47:00,364 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-19 14:47:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:47:00,716 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-07-19 14:47:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:47:00,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-07-19 14:47:00,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:47:00,718 INFO L225 Difference]: With dead ends: 27 [2022-07-19 14:47:00,718 INFO L226 Difference]: Without dead ends: 20 [2022-07-19 14:47:00,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:47:00,719 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:47:00,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 36 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 14:47:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-19 14:47:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-19 14:47:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-19 14:47:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-19 14:47:00,722 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2022-07-19 14:47:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:47:00,722 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-19 14:47:00,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-19 14:47:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-07-19 14:47:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 14:47:00,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:47:00,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:47:00,731 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-19 14:47:00,927 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-19 14:47:00,927 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:47:00,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:47:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash -434920839, now seen corresponding path program 1 times [2022-07-19 14:47:00,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:47:00,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102274359] [2022-07-19 14:47:00,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:00,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:47:00,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:47:00,931 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-19 14:47:00,933 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-19 14:47:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:01,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-19 14:47:01,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:47:01,182 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-19 14:47:01,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-07-19 14:47:01,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:47:01,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,218 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 29 treesize of output 33 [2022-07-19 14:47:01,232 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 30 treesize of output 30 [2022-07-19 14:47:01,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-19 14:47:01,247 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 8 treesize of output 7 [2022-07-19 14:47:01,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:47:01,551 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-19 14:47:01,551 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2022-07-19 14:47:01,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,629 INFO L356 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-07-19 14:47:01,629 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-07-19 14:47:01,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,646 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 26 treesize of output 23 [2022-07-19 14:47:01,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,659 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 26 treesize of output 23 [2022-07-19 14:47:01,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-19 14:47:01,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-19 14:47:01,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,714 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-19 14:47:01,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2022-07-19 14:47:01,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:01,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-07-19 14:47:02,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 59 [2022-07-19 14:47:02,023 INFO L356 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-07-19 14:47:02,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 27 [2022-07-19 14:47:02,032 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:47:02,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2022-07-19 14:47:02,075 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:47:02,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2022-07-19 14:47:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:47:02,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:47:02,472 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-19 14:47:02,472 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 239 treesize of output 216 [2022-07-19 14:47:02,655 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_267 (_ BitVec 32)) (|v_ULTIMATE.start_main_~n~0#1.offset_3| (_ BitVec 32)) (v_ArrVal_266 (_ BitVec 32)) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_277 (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| v_ArrVal_266) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_6 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~n~0#1.offset_3|)))) (bvslt (select (select (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (let ((.cse7 (store |c_#memory_int| v_ArrVal_266 v_ArrVal_276))) (store .cse7 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 v_ArrVal_267)))) (.cse1 (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_266 v_ArrVal_272) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_266 v_ArrVal_280) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 v_ArrVal_266)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| v_ArrVal_266 v_arrayElimArr_6))) (store .cse4 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 v_ArrVal_277))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (not (= (select v_arrayElimArr_6 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1.offset_3|)) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-19 14:47:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-19 14:47:02,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:47:02,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102274359] [2022-07-19 14:47:02,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102274359] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:47:02,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:47:02,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-07-19 14:47:02,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142951353] [2022-07-19 14:47:02,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:47:02,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 14:47:02,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:47:02,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 14:47:02,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2022-07-19 14:47:02,932 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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-19 14:47:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:47:04,022 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-07-19 14:47:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:47:04,023 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 12 [2022-07-19 14:47:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:47:04,024 INFO L225 Difference]: With dead ends: 33 [2022-07-19 14:47:04,024 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:47:04,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=172, Unknown=1, NotChecked=28, Total=272 [2022-07-19 14:47:04,025 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 14:47:04,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 52 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 56 Unchecked, 0.7s Time] [2022-07-19 14:47:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:47:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-07-19 14:47:04,028 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-19 14:47:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-07-19 14:47:04,029 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 12 [2022-07-19 14:47:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:47:04,029 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-07-19 14:47:04,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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-19 14:47:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-07-19 14:47:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 14:47:04,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:47:04,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:47:04,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:47:04,242 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-19 14:47:04,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:47:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:47:04,242 INFO L85 PathProgramCache]: Analyzing trace with hash -434918917, now seen corresponding path program 1 times [2022-07-19 14:47:04,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:47:04,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783271294] [2022-07-19 14:47:04,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:04,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:47:04,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:47:04,244 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-19 14:47:04,245 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-19 14:47:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:04,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 14:47:04,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:47:04,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,425 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 18 treesize of output 19 [2022-07-19 14:47:04,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,446 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-19 14:47:04,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-19 14:47:04,477 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-19 14:47:04,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-07-19 14:47:04,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,590 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 26 treesize of output 23 [2022-07-19 14:47:04,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,618 INFO L356 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-07-19 14:47:04,618 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-07-19 14:47:04,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-07-19 14:47:04,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-19 14:47:04,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:04,655 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 14:47:04,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-19 14:47:04,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2022-07-19 14:47:04,766 INFO L356 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-07-19 14:47:04,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 58 [2022-07-19 14:47:04,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-07-19 14:47:04,895 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:47:04,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 90 [2022-07-19 14:47:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:47:05,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:47:05,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2022-07-19 14:47:07,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_67 (_ BitVec 32))) (bvsgt (select (select (store |c_#memory_int| v_arrayElimCell_67 (let ((.cse0 (select |c_#memory_int| v_arrayElimCell_67)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (store .cse0 .cse1 (bvadd (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32))) is different from false [2022-07-19 14:47:09,107 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_67 (_ BitVec 32))) (bvsgt (select (select (store |c_#memory_int| v_arrayElimCell_67 (let ((.cse0 (select |c_#memory_int| v_arrayElimCell_67)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (store .cse0 .cse1 (bvadd (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32))) is different from false [2022-07-19 14:47:09,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.base_5| (_ BitVec 32)) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32)) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_366 (_ BitVec 32)) (v_ArrVal_365 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_5|))) (bvsgt (select (select (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_361))) (store .cse4 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse3 v_ArrVal_366))))) (store .cse0 v_arrayElimCell_67 (let ((.cse1 (select .cse0 v_arrayElimCell_67)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_364) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_362) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3 v_ArrVal_365)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (store .cse1 .cse2 (bvadd (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse1 .cse2))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32)))) is different from false [2022-07-19 14:47:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-19 14:47:09,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:47:09,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783271294] [2022-07-19 14:47:09,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783271294] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:47:09,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:47:09,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2022-07-19 14:47:09,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70291225] [2022-07-19 14:47:09,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:47:09,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 14:47:09,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:47:09,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 14:47:09,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=49, Unknown=3, NotChecked=48, Total=132 [2022-07-19 14:47:09,227 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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-19 14:47:11,560 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv100 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (bvsgt (select (select (store |c_#memory_int| v_arrayElimCell_67 (let ((.cse0 (select |c_#memory_int| v_arrayElimCell_67)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (store .cse0 .cse1 (bvadd (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~m~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~m~0#1.base|)) (_ bv1 1))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv1 32)) (= |c_ULTIMATE.start_main_~m~0#1.offset| (_ bv0 32)) (= (bvadd (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|)) is different from false [2022-07-19 14:47:13,567 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv100 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (bvsgt (select (select (store |c_#memory_int| v_arrayElimCell_67 (let ((.cse0 (select |c_#memory_int| v_arrayElimCell_67)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (store .cse0 .cse1 (bvadd (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~m~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv1 32)) (= |c_ULTIMATE.start_main_~m~0#1.offset| (_ bv0 32))) is different from false [2022-07-19 14:47:17,699 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_67 (_ BitVec 32))) (bvsgt (select (select (store |c_#memory_int| v_arrayElimCell_67 (let ((.cse0 (select |c_#memory_int| v_arrayElimCell_67)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (store .cse0 .cse1 (bvadd (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv0 32)) (_ bv1 32)) (= (_ bv100 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~m~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~m~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) (_ bv4 32)))) is different from false [2022-07-19 14:47:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:47:17,826 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-07-19 14:47:17,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:47:17,826 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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 12 [2022-07-19 14:47:17,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:47:17,827 INFO L225 Difference]: With dead ends: 37 [2022-07-19 14:47:17,827 INFO L226 Difference]: Without dead ends: 30 [2022-07-19 14:47:17,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=52, Invalid=76, Unknown=6, NotChecked=138, Total=272 [2022-07-19 14:47:17,828 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:47:17,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 34 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 34 Invalid, 0 Unknown, 40 Unchecked, 0.4s Time] [2022-07-19 14:47:17,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-19 14:47:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-19 14:47:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-19 14:47:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-07-19 14:47:17,831 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2022-07-19 14:47:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:47:17,831 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-07-19 14:47:17,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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-19 14:47:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-07-19 14:47:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 14:47:17,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:47:17,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:47:17,843 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-19 14:47:18,032 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-19 14:47:18,032 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:47:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:47:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash -433073797, now seen corresponding path program 1 times [2022-07-19 14:47:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:47:18,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079876844] [2022-07-19 14:47:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:18,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:47:18,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:47:18,034 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-19 14:47:18,037 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-19 14:47:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:18,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-19 14:47:18,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:47:18,240 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-19 14:47:18,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-07-19 14:47:18,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:18,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:47:18,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-19 14:47:18,263 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 14 treesize of output 16 [2022-07-19 14:47:18,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:18,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:18,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-19 14:47:18,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:18,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:18,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 14:47:18,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:18,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-07-19 14:47:18,346 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 14:47:18,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2022-07-19 14:47:18,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:47:18,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-07-19 14:47:18,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-19 14:47:18,456 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:47:18,456 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2022-07-19 14:47:18,459 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 6 treesize of output 4 [2022-07-19 14:47:18,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-19 14:47:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:47:18,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:47:18,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-19 14:47:18,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (_ BitVec 32)) (v_ArrVal_451 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_82 (_ BitVec 32)) (v_ArrVal_452 (_ BitVec 32)) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| v_ArrVal_447 v_ArrVal_455) |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_454))) (or (not (= (select |c_#valid| v_ArrVal_447) (_ bv0 1))) (bvslt (select (select (store .cse0 v_arrayElimCell_82 v_ArrVal_456) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (bvsle (select (select .cse0 v_arrayElimCell_82) (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_447 v_ArrVal_451) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_447 v_ArrVal_448) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|) v_ArrVal_452)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv100 32))))) is different from false [2022-07-19 14:47:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-19 14:47:18,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:47:18,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079876844] [2022-07-19 14:47:18,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079876844] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:47:18,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:47:18,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-19 14:47:18,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84278285] [2022-07-19 14:47:18,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:47:18,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 14:47:18,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:47:18,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 14:47:18,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=4, NotChecked=20, Total=156 [2022-07-19 14:47:18,680 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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-19 14:47:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:47:19,317 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-07-19 14:47:19,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:47:19,318 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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 12 [2022-07-19 14:47:19,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:47:19,318 INFO L225 Difference]: With dead ends: 29 [2022-07-19 14:47:19,318 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 14:47:19,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=4, NotChecked=24, Total=210 [2022-07-19 14:47:19,319 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 14:47:19,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 46 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 46 Invalid, 0 Unknown, 38 Unchecked, 0.6s Time] [2022-07-19 14:47:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 14:47:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-19 14:47:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 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-19 14:47:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-07-19 14:47:19,322 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 12 [2022-07-19 14:47:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:47:19,322 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-19 14:47:19,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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-19 14:47:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-07-19 14:47:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 14:47:19,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:47:19,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:47:19,332 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-19 14:47:19,523 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-19 14:47:19,523 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:47:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:47:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash -857850716, now seen corresponding path program 1 times [2022-07-19 14:47:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:47:19,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450598858] [2022-07-19 14:47:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:19,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:47:19,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:47:19,525 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-19 14:47:19,526 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-19 14:47:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:19,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-19 14:47:19,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:47:19,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:19,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:19,686 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 29 treesize of output 33 [2022-07-19 14:47:19,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:19,691 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 30 treesize of output 30 [2022-07-19 14:47:19,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:19,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:19,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:19,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-19 14:47:19,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:19,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:19,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:47:19,717 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-19 14:47:19,731 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 17 treesize of output 15 [2022-07-19 14:47:19,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:19,754 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 18 treesize of output 19 [2022-07-19 14:47:19,855 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:47:19,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 99 [2022-07-19 14:47:19,861 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 35 [2022-07-19 14:47:19,864 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 56 treesize of output 54 [2022-07-19 14:47:22,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:22,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:47:22,092 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:47:22,093 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 2 case distinctions, treesize of input 88 treesize of output 52 [2022-07-19 14:47:22,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:22,107 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-19 14:47:22,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 35 [2022-07-19 14:47:22,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2022-07-19 14:47:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:47:22,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:47:26,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvsle (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_516)) (.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_515)) (.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8)) (.cse6 (bvadd (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8) (_ bv4 32)))) (select (select (store |c_#memory_int| .cse0 (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (store .cse1 .cse2 (bvadd (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select .cse1 .cse2))))) (select (select .cse4 .cse5) .cse6)) (select (select .cse7 .cse5) .cse6)))))) (_ bv100 32)))) is different from false [2022-07-19 14:47:26,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (not (bvsle (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_516)) (.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_515)) (.cse8 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) .cse8)) (.cse6 (bvadd (_ bv4 32) (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse8)))) (select (select (store |c_#memory_int| .cse0 (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (store .cse1 .cse2 (bvadd (select .cse1 .cse2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (select (select .cse4 .cse5) .cse6)) (select (select .cse7 .cse5) .cse6)))))) (_ bv100 32)))) is different from false [2022-07-19 14:47:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-19 14:47:26,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:47:26,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450598858] [2022-07-19 14:47:26,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450598858] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:47:26,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:47:26,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-19 14:47:26,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074649122] [2022-07-19 14:47:26,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:47:26,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 14:47:26,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:47:26,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 14:47:26,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=5, NotChecked=34, Total=132 [2022-07-19 14:47:26,283 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:47:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:47:40,003 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-07-19 14:47:40,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:47:40,004 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-19 14:47:40,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:47:40,004 INFO L225 Difference]: With dead ends: 38 [2022-07-19 14:47:40,004 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:47:40,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=9, NotChecked=46, Total=210 [2022-07-19 14:47:40,006 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:47:40,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 73 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 34 Unchecked, 1.4s Time] [2022-07-19 14:47:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:47:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-07-19 14:47:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 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-19 14:47:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-19 14:47:40,010 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 15 [2022-07-19 14:47:40,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:47:40,011 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-19 14:47:40,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:47:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-19 14:47:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 14:47:40,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:47:40,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:47:40,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-19 14:47:40,211 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-19 14:47:40,212 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:47:40,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:47:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash -856003674, now seen corresponding path program 1 times [2022-07-19 14:47:40,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:47:40,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455615827] [2022-07-19 14:47:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:47:40,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:47:40,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:47:40,214 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:47:40,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 14:47:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:47:40,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-19 14:47:40,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:47:40,384 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 14:47:40,384 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:47:40,393 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 11 treesize of output 9 [2022-07-19 14:47:40,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:40,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:47:40,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:40,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:40,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:40,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-07-19 14:47:40,547 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:47:40,548 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 1 case distinctions, treesize of input 94 treesize of output 87 [2022-07-19 14:47:40,553 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 35 [2022-07-19 14:47:40,558 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 50 treesize of output 48 [2022-07-19 14:47:42,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:42,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:47:42,829 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:47:42,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 78 [2022-07-19 14:47:42,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:47:42,846 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-19 14:47:42,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 44 [2022-07-19 14:47:42,851 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 37 treesize of output 24 [2022-07-19 14:47:42,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-07-19 14:47:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:47:42,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:47:47,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (bvslt (select (select (let ((.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse12))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_576)) (.cse13 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse13)) (.cse8 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_577))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) .cse13)) (.cse7 (bvadd (_ bv4 32) .cse5))) (let ((.cse0 (store |c_#memory_int| .cse9 (let ((.cse10 (select |c_#memory_int| .cse9)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse12))) (store .cse10 .cse11 (bvadd (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select .cse10 .cse11)))))) (.cse1 (select (select .cse8 .cse4) .cse7))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse6 .cse4) .cse7))) (store .cse2 .cse3 (bvadd (bvneg (select (select .cse0 .cse4) .cse5)) (select .cse2 .cse3))))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32))) is different from false [2022-07-19 14:47:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-19 14:47:49,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:47:49,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455615827] [2022-07-19 14:47:49,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455615827] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:47:49,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:47:49,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-19 14:47:49,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447927678] [2022-07-19 14:47:49,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:47:49,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 14:47:49,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:47:49,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 14:47:49,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=94, Unknown=7, NotChecked=20, Total=156 [2022-07-19 14:47:49,639 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:48:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:12,424 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-19 14:48:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:48:12,425 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-19 14:48:12,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:12,425 INFO L225 Difference]: With dead ends: 35 [2022-07-19 14:48:12,425 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 14:48:12,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=71, Invalid=190, Unknown=15, NotChecked=30, Total=306 [2022-07-19 14:48:12,426 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:48:12,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 57 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 29 Invalid, 0 Unknown, 49 Unchecked, 0.3s Time] [2022-07-19 14:48:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 14:48:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-07-19 14:48:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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-19 14:48:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-19 14:48:12,430 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2022-07-19 14:48:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:12,430 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-19 14:48:12,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:48:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-19 14:48:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 14:48:12,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:12,431 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:48:12,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-19 14:48:12,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:48:12,631 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:12,632 INFO L85 PathProgramCache]: Analyzing trace with hash -856001752, now seen corresponding path program 1 times [2022-07-19 14:48:12,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:48:12,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994539720] [2022-07-19 14:48:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:12,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:48:12,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:48:12,636 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:48:12,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-19 14:48:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:12,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-19 14:48:12,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:12,823 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 14:48:12,823 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:48:12,832 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 11 treesize of output 9 [2022-07-19 14:48:12,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:12,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:12,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:12,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-07-19 14:48:12,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:12,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-19 14:48:13,006 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:48:13,007 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 1 case distinctions, treesize of input 94 treesize of output 87 [2022-07-19 14:48:13,013 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 35 [2022-07-19 14:48:13,021 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 52 treesize of output 50 [2022-07-19 14:48:15,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:15,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:15,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:15,299 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:48:15,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 80 [2022-07-19 14:48:15,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:15,329 INFO L356 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-07-19 14:48:15,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 46 [2022-07-19 14:48:15,339 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 39 treesize of output 26 [2022-07-19 14:48:15,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-19 14:48:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:48:15,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:26,126 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_639 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsgt (select (select (let ((.cse12 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse12))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_641)) (.cse13 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse8 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_639))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse7 (bvadd .cse5 (_ bv4 32)))) (let ((.cse0 (store |c_#memory_int| .cse9 (let ((.cse10 (select |c_#memory_int| .cse9)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse12))) (store .cse10 .cse11 (bvadd (select .cse10 .cse11) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse1 (select (select .cse8 .cse4) .cse7))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse6 .cse4) .cse7))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) (bvneg (select (select .cse0 .cse4) .cse5)))))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32))) is different from false [2022-07-19 14:48:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:48:26,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:48:26,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994539720] [2022-07-19 14:48:26,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994539720] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:26,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:48:26,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-19 14:48:26,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454954369] [2022-07-19 14:48:26,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:26,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 14:48:26,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:48:26,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 14:48:26,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=88, Unknown=13, NotChecked=20, Total=156 [2022-07-19 14:48:26,267 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-19 14:48:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:51,115 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-07-19 14:48:51,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 14:48:51,117 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-19 14:48:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:51,117 INFO L225 Difference]: With dead ends: 40 [2022-07-19 14:48:51,117 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 14:48:51,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=73, Invalid=181, Unknown=22, NotChecked=30, Total=306 [2022-07-19 14:48:51,118 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:48:51,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 55 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 33 Unchecked, 1.4s Time] [2022-07-19 14:48:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 14:48:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-07-19 14:48:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 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-19 14:48:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-19 14:48:51,123 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 15 [2022-07-19 14:48:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:51,123 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-19 14:48:51,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-19 14:48:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-07-19 14:48:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 14:48:51,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:51,124 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:48:51,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-19 14:48:51,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:48:51,334 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:51,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash -439025439, now seen corresponding path program 1 times [2022-07-19 14:48:51,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:48:51,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126110235] [2022-07-19 14:48:51,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:51,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:48:51,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:48:51,337 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:48:51,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-19 14:48:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:51,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-19 14:48:51,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:51,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:51,644 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 18 treesize of output 19 [2022-07-19 14:48:51,666 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-19 14:48:51,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-07-19 14:48:51,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:51,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:51,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:51,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-07-19 14:48:51,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:51,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-07-19 14:48:51,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:51,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:51,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-07-19 14:48:51,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:51,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:51,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-07-19 14:48:51,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:51,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 25 [2022-07-19 14:48:51,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:51,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2022-07-19 14:48:51,836 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-19 14:48:51,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2022-07-19 14:48:51,846 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-19 14:48:52,101 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-19 14:48:52,101 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 113 [2022-07-19 14:48:52,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:52,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-07-19 14:48:52,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:52,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2022-07-19 14:48:52,674 INFO L356 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2022-07-19 14:48:52,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 222 treesize of output 105 [2022-07-19 14:48:52,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 48 [2022-07-19 14:48:52,711 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-07-19 14:48:52,712 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 53 [2022-07-19 14:48:53,457 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:53,457 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 62 [2022-07-19 14:48:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:48:53,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:49:00,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~m~0#1.offset| (_ BitVec 32)) (v_ArrVal_738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_739 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_739)) (.cse12 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse10 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_738))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse12)) (.cse9 (bvadd (_ bv4 32) .cse6))) (let ((.cse0 (store |c_#memory_int| .cse11 v_ArrVal_740)) (.cse1 (select (select .cse10 .cse5) .cse9))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse8 .cse5) .cse9))) (let ((.cse7 (select (select .cse0 |c_ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|)) (.cse4 (select .cse2 .cse3))) (or (bvslt (select (select (store .cse0 .cse1 (store .cse2 .cse3 (bvadd .cse4 (select (select .cse0 .cse5) .cse6)))) |c_ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (not (bvslt .cse7 (_ bv110 32))) (not (bvsgt .cse7 (_ bv90 32))) (not (bvsle .cse4 (_ bv100 32)))))))))))) is different from false [2022-07-19 14:49:00,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~m~0#1.offset| (_ BitVec 32)) (v_ArrVal_738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_739 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_739)) (.cse12 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse12)) (.cse10 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_738))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) .cse12)) (.cse9 (bvadd (_ bv4 32) .cse6))) (let ((.cse1 (store |c_#memory_int| .cse11 v_ArrVal_740)) (.cse2 (select (select .cse10 .cse5) .cse9))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse8 .cse5) .cse9))) (let ((.cse0 (select .cse3 .cse4)) (.cse7 (select (select .cse1 |c_ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|))) (or (not (bvsle .cse0 (_ bv100 32))) (bvslt (select (select (store .cse1 .cse2 (store .cse3 .cse4 (bvadd .cse0 (select (select .cse1 .cse5) .cse6)))) |c_ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (not (bvslt .cse7 (_ bv110 32))) (not (bvsgt .cse7 (_ bv90 32)))))))))))) is different from false [2022-07-19 14:49:02,036 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-19 14:49:02,036 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 2293 treesize of output 1469 [2022-07-19 14:49:02,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:02,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:02,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:02,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:02,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1453 treesize of output 1355 [2022-07-19 14:49:24,229 WARN L233 SmtUtils]: Spent 21.65s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-19 14:49:24,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:24,231 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 311924 treesize of output 304114