./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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-manipulation/merge_sort-2.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 e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 23:46:01,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 23:46:01,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 23:46:01,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 23:46:01,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 23:46:01,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 23:46:01,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 23:46:01,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 23:46:01,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 23:46:01,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 23:46:01,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 23:46:01,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 23:46:01,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 23:46:01,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 23:46:01,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 23:46:01,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 23:46:01,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 23:46:01,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 23:46:01,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 23:46:01,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 23:46:01,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 23:46:01,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 23:46:01,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 23:46:01,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 23:46:01,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 23:46:01,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 23:46:01,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 23:46:01,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 23:46:01,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 23:46:01,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 23:46:01,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 23:46:01,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 23:46:01,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 23:46:01,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 23:46:01,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 23:46:01,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 23:46:01,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 23:46:01,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 23:46:01,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 23:46:01,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 23:46:01,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 23:46:01,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 23:46:01,226 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 23:46:01,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 23:46:01,227 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 23:46:01,227 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 23:46:01,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 23:46:01,228 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 23:46:01,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 23:46:01,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 23:46:01,229 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 23:46:01,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 23:46:01,230 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 23:46:01,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 23:46:01,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 23:46:01,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 23:46:01,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 23:46:01,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 23:46:01,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 23:46:01,231 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 23:46:01,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 23:46:01,232 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 23:46:01,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 23:46:01,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 23:46:01,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 23:46:01,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 23:46:01,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:46:01,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 23:46:01,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 23:46:01,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 23:46:01,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 23:46:01,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 23:46:01,233 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 23:46:01,233 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 23:46:01,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 23:46:01,234 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 -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2021-12-27 23:46:01,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 23:46:01,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 23:46:01,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 23:46:01,513 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 23:46:01,514 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 23:46:01,515 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2021-12-27 23:46:01,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337f576e3/a0862d8c26b04484b822dd8e5794b63a/FLAGeb6885a2b [2021-12-27 23:46:02,030 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 23:46:02,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2021-12-27 23:46:02,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337f576e3/a0862d8c26b04484b822dd8e5794b63a/FLAGeb6885a2b [2021-12-27 23:46:02,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337f576e3/a0862d8c26b04484b822dd8e5794b63a [2021-12-27 23:46:02,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 23:46:02,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 23:46:02,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 23:46:02,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 23:46:02,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 23:46:02,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:46:02" (1/1) ... [2021-12-27 23:46:02,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f07f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02, skipping insertion in model container [2021-12-27 23:46:02,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:46:02" (1/1) ... [2021-12-27 23:46:02,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 23:46:02,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 23:46:02,842 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-manipulation/merge_sort-2.i[22632,22645] [2021-12-27 23:46:02,880 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:46:02,887 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 23:46:02,918 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-manipulation/merge_sort-2.i[22632,22645] [2021-12-27 23:46:02,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:46:02,963 INFO L208 MainTranslator]: Completed translation [2021-12-27 23:46:02,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02 WrapperNode [2021-12-27 23:46:02,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 23:46:02,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 23:46:02,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 23:46:02,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 23:46:02,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02" (1/1) ... [2021-12-27 23:46:02,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02" (1/1) ... [2021-12-27 23:46:03,030 INFO L137 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 285 [2021-12-27 23:46:03,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 23:46:03,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 23:46:03,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 23:46:03,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 23:46:03,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02" (1/1) ... [2021-12-27 23:46:03,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02" (1/1) ... [2021-12-27 23:46:03,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02" (1/1) ... [2021-12-27 23:46:03,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02" (1/1) ... [2021-12-27 23:46:03,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02" (1/1) ... [2021-12-27 23:46:03,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02" (1/1) ... [2021-12-27 23:46:03,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02" (1/1) ... [2021-12-27 23:46:03,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 23:46:03,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 23:46:03,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 23:46:03,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 23:46:03,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02" (1/1) ... [2021-12-27 23:46:03,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:46:03,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:03,111 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) [2021-12-27 23:46:03,141 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 [2021-12-27 23:46:03,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-27 23:46:03,158 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2021-12-27 23:46:03,158 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2021-12-27 23:46:03,158 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-12-27 23:46:03,158 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-12-27 23:46:03,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-27 23:46:03,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-27 23:46:03,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 23:46:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-27 23:46:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-27 23:46:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-27 23:46:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 23:46:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 23:46:03,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 23:46:03,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 23:46:03,264 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 23:46:03,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 23:46:03,526 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 23:46:03,530 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 23:46:03,531 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2021-12-27 23:46:03,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:46:03 BoogieIcfgContainer [2021-12-27 23:46:03,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 23:46:03,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 23:46:03,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 23:46:03,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 23:46:03,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:46:02" (1/3) ... [2021-12-27 23:46:03,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dcab46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:46:03, skipping insertion in model container [2021-12-27 23:46:03,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:02" (2/3) ... [2021-12-27 23:46:03,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dcab46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:46:03, skipping insertion in model container [2021-12-27 23:46:03,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:46:03" (3/3) ... [2021-12-27 23:46:03,537 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2021-12-27 23:46:03,540 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 23:46:03,541 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 23:46:03,575 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 23:46:03,595 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 23:46:03,595 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 23:46:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 93 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-27 23:46:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-27 23:46:03,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:03,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:03,610 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:03,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:03,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2117458630, now seen corresponding path program 1 times [2021-12-27 23:46:03,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:03,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705913365] [2021-12-27 23:46:03,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:03,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:03,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:03,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705913365] [2021-12-27 23:46:03,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705913365] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:03,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:03,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 23:46:03,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122721738] [2021-12-27 23:46:03,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:03,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 23:46:03,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:03,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 23:46:03,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:46:03,744 INFO L87 Difference]: Start difference. First operand has 96 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 93 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:03,781 INFO L93 Difference]: Finished difference Result 188 states and 335 transitions. [2021-12-27 23:46:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 23:46:03,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-27 23:46:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:03,792 INFO L225 Difference]: With dead ends: 188 [2021-12-27 23:46:03,792 INFO L226 Difference]: Without dead ends: 87 [2021-12-27 23:46:03,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:46:03,799 INFO L933 BasicCegarLoop]: 119 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, 119 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 [2021-12-27 23:46:03,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:46:03,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-27 23:46:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-27 23:46:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2021-12-27 23:46:03,838 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2021-12-27 23:46:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:03,838 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2021-12-27 23:46:03,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2021-12-27 23:46:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-27 23:46:03,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:03,840 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:03,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 23:46:03,841 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:03,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash 592840654, now seen corresponding path program 1 times [2021-12-27 23:46:03,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:03,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579913378] [2021-12-27 23:46:03,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:03,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:03,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:03,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579913378] [2021-12-27 23:46:03,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579913378] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:03,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:03,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 23:46:03,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162100184] [2021-12-27 23:46:03,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:03,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 23:46:03,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:03,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 23:46:03,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 23:46:03,914 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:03,952 INFO L93 Difference]: Finished difference Result 172 states and 218 transitions. [2021-12-27 23:46:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 23:46:03,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-27 23:46:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:03,955 INFO L225 Difference]: With dead ends: 172 [2021-12-27 23:46:03,955 INFO L226 Difference]: Without dead ends: 93 [2021-12-27 23:46:03,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 23:46:03,961 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:03,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 212 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:46:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-27 23:46:03,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2021-12-27 23:46:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 86 states have internal predecessors, (95), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2021-12-27 23:46:03,978 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 8 [2021-12-27 23:46:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:03,979 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2021-12-27 23:46:03,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2021-12-27 23:46:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-27 23:46:03,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:03,982 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:03,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 23:46:03,982 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:03,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1362713673, now seen corresponding path program 1 times [2021-12-27 23:46:03,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:03,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558756482] [2021-12-27 23:46:03,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:03,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:04,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:04,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558756482] [2021-12-27 23:46:04,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558756482] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:04,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:04,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:46:04,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145622453] [2021-12-27 23:46:04,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:04,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:46:04,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:04,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:46:04,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:46:04,081 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:04,183 INFO L93 Difference]: Finished difference Result 235 states and 308 transitions. [2021-12-27 23:46:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:46:04,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-27 23:46:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:04,185 INFO L225 Difference]: With dead ends: 235 [2021-12-27 23:46:04,185 INFO L226 Difference]: Without dead ends: 230 [2021-12-27 23:46:04,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-27 23:46:04,186 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 516 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:04,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 276 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:46:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-27 23:46:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 92. [2021-12-27 23:46:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2021-12-27 23:46:04,195 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 14 [2021-12-27 23:46:04,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:04,196 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2021-12-27 23:46:04,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2021-12-27 23:46:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-27 23:46:04,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:04,197 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:04,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-27 23:46:04,197 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:04,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:04,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1343418310, now seen corresponding path program 1 times [2021-12-27 23:46:04,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:04,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194470575] [2021-12-27 23:46:04,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:04,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-27 23:46:04,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:04,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194470575] [2021-12-27 23:46:04,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194470575] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:04,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:04,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:46:04,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754588161] [2021-12-27 23:46:04,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:04,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:46:04,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:04,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:46:04,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:46:04,260 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:04,355 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2021-12-27 23:46:04,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:46:04,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-27 23:46:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:04,356 INFO L225 Difference]: With dead ends: 94 [2021-12-27 23:46:04,356 INFO L226 Difference]: Without dead ends: 91 [2021-12-27 23:46:04,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:46:04,358 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 11 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:04,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 319 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:46:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-27 23:46:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-27 23:46:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 88 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2021-12-27 23:46:04,364 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 21 [2021-12-27 23:46:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:04,364 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2021-12-27 23:46:04,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2021-12-27 23:46:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-27 23:46:04,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:04,365 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:04,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-27 23:46:04,365 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:04,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:04,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1668834300, now seen corresponding path program 1 times [2021-12-27 23:46:04,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:04,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508424948] [2021-12-27 23:46:04,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:04,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-27 23:46:04,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:04,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508424948] [2021-12-27 23:46:04,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508424948] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:04,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:04,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:46:04,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076790752] [2021-12-27 23:46:04,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:04,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:46:04,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:04,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:46:04,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:46:04,426 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:04,527 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2021-12-27 23:46:04,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:46:04,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-27 23:46:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:04,528 INFO L225 Difference]: With dead ends: 118 [2021-12-27 23:46:04,529 INFO L226 Difference]: Without dead ends: 115 [2021-12-27 23:46:04,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:46:04,530 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:04,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 284 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:46:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-27 23:46:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2021-12-27 23:46:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 87 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2021-12-27 23:46:04,536 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 21 [2021-12-27 23:46:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:04,536 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2021-12-27 23:46:04,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2021-12-27 23:46:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-27 23:46:04,537 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:04,537 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:04,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-27 23:46:04,538 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:04,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1088949266, now seen corresponding path program 1 times [2021-12-27 23:46:04,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:04,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740080586] [2021-12-27 23:46:04,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:04,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:04,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:04,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740080586] [2021-12-27 23:46:04,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740080586] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:04,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:04,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 23:46:04,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389586112] [2021-12-27 23:46:04,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:04,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 23:46:04,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:04,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 23:46:04,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:46:04,598 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:04,749 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2021-12-27 23:46:04,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:46:04,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-27 23:46:04,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:04,751 INFO L225 Difference]: With dead ends: 195 [2021-12-27 23:46:04,751 INFO L226 Difference]: Without dead ends: 192 [2021-12-27 23:46:04,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-27 23:46:04,752 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 348 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:04,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 283 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:46:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-12-27 23:46:04,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 96. [2021-12-27 23:46:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 93 states have internal predecessors, (103), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2021-12-27 23:46:04,759 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 24 [2021-12-27 23:46:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:04,760 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2021-12-27 23:46:04,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2021-12-27 23:46:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-27 23:46:04,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:04,761 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:04,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-27 23:46:04,761 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:04,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:04,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1875885747, now seen corresponding path program 1 times [2021-12-27 23:46:04,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:04,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591210333] [2021-12-27 23:46:04,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:04,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:04,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:04,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591210333] [2021-12-27 23:46:04,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591210333] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:04,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:04,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 23:46:04,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360422575] [2021-12-27 23:46:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:04,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 23:46:04,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:04,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 23:46:04,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:46:04,807 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:04,967 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2021-12-27 23:46:04,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:46:04,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-27 23:46:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:04,968 INFO L225 Difference]: With dead ends: 194 [2021-12-27 23:46:04,968 INFO L226 Difference]: Without dead ends: 191 [2021-12-27 23:46:04,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-27 23:46:04,969 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 345 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:04,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 283 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:46:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-27 23:46:04,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2021-12-27 23:46:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 states have internal predecessors, (109), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2021-12-27 23:46:04,976 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 24 [2021-12-27 23:46:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:04,977 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2021-12-27 23:46:04,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2021-12-27 23:46:04,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-27 23:46:04,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:04,978 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:04,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-27 23:46:04,978 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:04,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash 833312563, now seen corresponding path program 1 times [2021-12-27 23:46:04,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:04,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845913380] [2021-12-27 23:46:04,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:04,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:05,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:05,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845913380] [2021-12-27 23:46:05,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845913380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:05,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:05,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 23:46:05,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269510164] [2021-12-27 23:46:05,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:05,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:46:05,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:46:05,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:46:05,051 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:05,355 INFO L93 Difference]: Finished difference Result 264 states and 335 transitions. [2021-12-27 23:46:05,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 23:46:05,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-27 23:46:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:05,357 INFO L225 Difference]: With dead ends: 264 [2021-12-27 23:46:05,357 INFO L226 Difference]: Without dead ends: 261 [2021-12-27 23:46:05,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-27 23:46:05,358 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 527 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:05,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [529 Valid, 331 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 23:46:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-12-27 23:46:05,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 105. [2021-12-27 23:46:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 102 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2021-12-27 23:46:05,366 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 27 [2021-12-27 23:46:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:05,366 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2021-12-27 23:46:05,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2021-12-27 23:46:05,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-27 23:46:05,367 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:05,367 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:05,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-27 23:46:05,368 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:05,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1708085367, now seen corresponding path program 1 times [2021-12-27 23:46:05,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:05,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162285301] [2021-12-27 23:46:05,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:05,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:05,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:05,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162285301] [2021-12-27 23:46:05,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162285301] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:05,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:05,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 23:46:05,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572209821] [2021-12-27 23:46:05,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:05,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:46:05,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:05,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:46:05,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:46:05,440 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:05,728 INFO L93 Difference]: Finished difference Result 263 states and 333 transitions. [2021-12-27 23:46:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 23:46:05,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-27 23:46:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:05,732 INFO L225 Difference]: With dead ends: 263 [2021-12-27 23:46:05,732 INFO L226 Difference]: Without dead ends: 260 [2021-12-27 23:46:05,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-27 23:46:05,734 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 523 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:05,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 331 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 23:46:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-12-27 23:46:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 108. [2021-12-27 23:46:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 105 states have internal predecessors, (115), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2021-12-27 23:46:05,746 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 27 [2021-12-27 23:46:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:05,747 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2021-12-27 23:46:05,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2021-12-27 23:46:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-27 23:46:05,749 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:05,749 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:05,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-27 23:46:05,750 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:05,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:05,750 INFO L85 PathProgramCache]: Analyzing trace with hash -399551200, now seen corresponding path program 1 times [2021-12-27 23:46:05,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:05,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313700402] [2021-12-27 23:46:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:05,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-27 23:46:05,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:05,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313700402] [2021-12-27 23:46:05,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313700402] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:05,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146008114] [2021-12-27 23:46:05,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:05,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:05,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:05,857 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) [2021-12-27 23:46:05,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-27 23:46:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:05,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-27 23:46:05,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:06,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-12-27 23:46:06,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-27 23:46:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-27 23:46:06,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-27 23:46:06,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146008114] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:46:06,311 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:46:06,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-12-27 23:46:06,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427804580] [2021-12-27 23:46:06,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:06,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 23:46:06,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:06,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 23:46:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:46:06,312 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:06,410 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2021-12-27 23:46:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:46:06,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-27 23:46:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:06,411 INFO L225 Difference]: With dead ends: 110 [2021-12-27 23:46:06,411 INFO L226 Difference]: Without dead ends: 106 [2021-12-27 23:46:06,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-27 23:46:06,411 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 84 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:06,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 280 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:46:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-27 23:46:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-27 23:46:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 94 states have (on average 1.202127659574468) internal successors, (113), 103 states have internal predecessors, (113), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2021-12-27 23:46:06,427 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 32 [2021-12-27 23:46:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:06,427 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2021-12-27 23:46:06,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2021-12-27 23:46:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-27 23:46:06,428 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:06,428 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:06,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:06,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-27 23:46:06,628 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:06,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:06,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2096511860, now seen corresponding path program 1 times [2021-12-27 23:46:06,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:06,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766915918] [2021-12-27 23:46:06,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:06,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:06,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:06,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766915918] [2021-12-27 23:46:06,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766915918] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:06,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:06,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 23:46:06,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123056229] [2021-12-27 23:46:06,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:06,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 23:46:06,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:06,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 23:46:06,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:46:06,700 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:06,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:06,775 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2021-12-27 23:46:06,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:46:06,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-27 23:46:06,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:06,776 INFO L225 Difference]: With dead ends: 146 [2021-12-27 23:46:06,776 INFO L226 Difference]: Without dead ends: 143 [2021-12-27 23:46:06,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-27 23:46:06,777 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 271 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:06,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 325 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:46:06,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-27 23:46:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 110. [2021-12-27 23:46:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 107 states have internal predecessors, (118), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2021-12-27 23:46:06,783 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 33 [2021-12-27 23:46:06,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:06,784 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2021-12-27 23:46:06,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:06,784 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2021-12-27 23:46:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-27 23:46:06,786 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:06,786 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:06,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-27 23:46:06,786 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:06,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:06,787 INFO L85 PathProgramCache]: Analyzing trace with hash -236025208, now seen corresponding path program 1 times [2021-12-27 23:46:06,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:06,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561748414] [2021-12-27 23:46:06,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:06,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:06,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:06,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561748414] [2021-12-27 23:46:06,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561748414] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:06,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144162095] [2021-12-27 23:46:06,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:06,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:06,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:06,956 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) [2021-12-27 23:46:06,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-27 23:46:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:07,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-27 23:46:07,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:07,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:07,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:07,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:07,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144162095] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:07,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 23:46:07,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 12 [2021-12-27 23:46:07,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070080983] [2021-12-27 23:46:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:07,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 23:46:07,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:07,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 23:46:07,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-27 23:46:07,258 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:07,518 INFO L93 Difference]: Finished difference Result 199 states and 252 transitions. [2021-12-27 23:46:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 23:46:07,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-27 23:46:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:07,521 INFO L225 Difference]: With dead ends: 199 [2021-12-27 23:46:07,521 INFO L226 Difference]: Without dead ends: 196 [2021-12-27 23:46:07,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-12-27 23:46:07,522 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 344 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:07,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 521 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 23:46:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-27 23:46:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 119. [2021-12-27 23:46:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 116 states have internal predecessors, (128), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2021-12-27 23:46:07,533 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 36 [2021-12-27 23:46:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:07,533 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2021-12-27 23:46:07,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2021-12-27 23:46:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-27 23:46:07,536 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:07,536 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:07,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:07,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-27 23:46:07,753 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:07,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash -73182163, now seen corresponding path program 1 times [2021-12-27 23:46:07,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:07,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766768629] [2021-12-27 23:46:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:07,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-27 23:46:07,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:07,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766768629] [2021-12-27 23:46:07,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766768629] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:07,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979953730] [2021-12-27 23:46:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:07,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:07,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:07,886 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) [2021-12-27 23:46:07,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-27 23:46:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:07,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-27 23:46:07,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:08,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:08,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-27 23:46:08,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:08,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-27 23:46:08,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-27 23:46:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-27 23:46:08,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-27 23:46:08,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979953730] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:46:08,195 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:46:08,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2021-12-27 23:46:08,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24821995] [2021-12-27 23:46:08,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:08,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-27 23:46:08,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:08,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-27 23:46:08,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-27 23:46:08,197 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:08,437 INFO L93 Difference]: Finished difference Result 299 states and 366 transitions. [2021-12-27 23:46:08,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 23:46:08,438 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-27 23:46:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:08,438 INFO L225 Difference]: With dead ends: 299 [2021-12-27 23:46:08,439 INFO L226 Difference]: Without dead ends: 214 [2021-12-27 23:46:08,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-27 23:46:08,439 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 234 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:08,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 546 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 23:46:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-12-27 23:46:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 130. [2021-12-27 23:46:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 127 states have internal predecessors, (140), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2021-12-27 23:46:08,464 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 38 [2021-12-27 23:46:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:08,464 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2021-12-27 23:46:08,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2021-12-27 23:46:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-27 23:46:08,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:08,465 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:08,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:08,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:08,681 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:08,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash 490774160, now seen corresponding path program 1 times [2021-12-27 23:46:08,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:08,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486873787] [2021-12-27 23:46:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:08,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:08,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:08,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486873787] [2021-12-27 23:46:08,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486873787] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:08,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:08,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 23:46:08,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379272066] [2021-12-27 23:46:08,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:08,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 23:46:08,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:08,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 23:46:08,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:46:08,724 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:08,798 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2021-12-27 23:46:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 23:46:08,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-27 23:46:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:08,799 INFO L225 Difference]: With dead ends: 238 [2021-12-27 23:46:08,800 INFO L226 Difference]: Without dead ends: 197 [2021-12-27 23:46:08,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-27 23:46:08,800 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 347 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:08,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 380 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:46:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-27 23:46:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2021-12-27 23:46:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 119 states have (on average 1.184873949579832) internal successors, (141), 128 states have internal predecessors, (141), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2021-12-27 23:46:08,810 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 38 [2021-12-27 23:46:08,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:08,811 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2021-12-27 23:46:08,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2021-12-27 23:46:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-27 23:46:08,811 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:08,811 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:08,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-27 23:46:08,812 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:08,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash -557560351, now seen corresponding path program 1 times [2021-12-27 23:46:08,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:08,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387504357] [2021-12-27 23:46:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:08,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:08,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:08,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387504357] [2021-12-27 23:46:08,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387504357] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:08,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:08,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 23:46:08,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598939899] [2021-12-27 23:46:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:08,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:46:08,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:46:08,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:46:08,857 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:09,040 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2021-12-27 23:46:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 23:46:09,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-27 23:46:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:09,041 INFO L225 Difference]: With dead ends: 165 [2021-12-27 23:46:09,041 INFO L226 Difference]: Without dead ends: 162 [2021-12-27 23:46:09,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-12-27 23:46:09,042 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 239 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:09,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 331 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:46:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-27 23:46:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 137. [2021-12-27 23:46:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 125 states have (on average 1.184) internal successors, (148), 134 states have internal predecessors, (148), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2021-12-27 23:46:09,065 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 39 [2021-12-27 23:46:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:09,065 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2021-12-27 23:46:09,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2021-12-27 23:46:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-27 23:46:09,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:09,066 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:09,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-27 23:46:09,066 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:09,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:09,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1187191262, now seen corresponding path program 1 times [2021-12-27 23:46:09,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:09,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329360413] [2021-12-27 23:46:09,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:09,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-27 23:46:09,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:09,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329360413] [2021-12-27 23:46:09,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329360413] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:09,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:09,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 23:46:09,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126302323] [2021-12-27 23:46:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:09,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 23:46:09,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:09,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 23:46:09,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-27 23:46:09,112 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:09,356 INFO L93 Difference]: Finished difference Result 316 states and 415 transitions. [2021-12-27 23:46:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-27 23:46:09,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-27 23:46:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:09,357 INFO L225 Difference]: With dead ends: 316 [2021-12-27 23:46:09,357 INFO L226 Difference]: Without dead ends: 275 [2021-12-27 23:46:09,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2021-12-27 23:46:09,358 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 715 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:09,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [717 Valid, 744 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:46:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-27 23:46:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 156. [2021-12-27 23:46:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 153 states have internal predecessors, (173), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-27 23:46:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 189 transitions. [2021-12-27 23:46:09,370 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 189 transitions. Word has length 39 [2021-12-27 23:46:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:09,371 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 189 transitions. [2021-12-27 23:46:09,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 189 transitions. [2021-12-27 23:46:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-27 23:46:09,371 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:09,371 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:09,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-27 23:46:09,372 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:09,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1447224354, now seen corresponding path program 1 times [2021-12-27 23:46:09,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:09,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932547091] [2021-12-27 23:46:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:09,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:09,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:09,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932547091] [2021-12-27 23:46:09,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932547091] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:09,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977985992] [2021-12-27 23:46:09,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:09,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:09,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:09,442 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) [2021-12-27 23:46:09,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-27 23:46:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:09,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-27 23:46:09,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:09,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:09,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-27 23:46:09,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:09,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-27 23:46:09,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:09,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:09,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:09,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:09,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977985992] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:46:09,799 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:46:09,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 10 [2021-12-27 23:46:09,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305231404] [2021-12-27 23:46:09,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:09,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 23:46:09,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:09,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 23:46:09,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-27 23:46:09,800 INFO L87 Difference]: Start difference. First operand 156 states and 189 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:09,890 INFO L93 Difference]: Finished difference Result 249 states and 306 transitions. [2021-12-27 23:46:09,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:46:09,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-27 23:46:09,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:09,891 INFO L225 Difference]: With dead ends: 249 [2021-12-27 23:46:09,892 INFO L226 Difference]: Without dead ends: 188 [2021-12-27 23:46:09,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-27 23:46:09,892 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 40 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:09,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 317 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:46:09,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-27 23:46:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2021-12-27 23:46:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 167 states have internal predecessors, (187), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-27 23:46:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2021-12-27 23:46:09,904 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 42 [2021-12-27 23:46:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:09,905 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2021-12-27 23:46:09,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2021-12-27 23:46:09,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-27 23:46:09,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:09,905 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:09,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:10,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-27 23:46:10,123 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:10,123 INFO L85 PathProgramCache]: Analyzing trace with hash -600772010, now seen corresponding path program 2 times [2021-12-27 23:46:10,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:10,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289906357] [2021-12-27 23:46:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:10,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:10,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:10,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289906357] [2021-12-27 23:46:10,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289906357] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:10,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918620380] [2021-12-27 23:46:10,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 23:46:10,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:10,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:10,472 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:46:10,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-27 23:46:10,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 23:46:10,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 23:46:10,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-27 23:46:10,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:10,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-27 23:46:10,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:10,628 INFO L387 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 16 treesize of output 17 [2021-12-27 23:46:10,651 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-27 23:46:10,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-27 23:46:10,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-27 23:46:10,701 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-27 23:46:10,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-27 23:46:10,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:10,751 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-27 23:46:10,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:10,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2021-12-27 23:46:11,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:11,189 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-27 23:46:11,190 INFO L387 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 3 case distinctions, treesize of input 52 treesize of output 23 [2021-12-27 23:46:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:11,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:11,309 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_10| Int) (v_ArrVal_588 (Array Int Int))) (or (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_588))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_10| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_10|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_10|) 0)))) is different from false [2021-12-27 23:46:11,356 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_10| Int) (|v_ULTIMATE.start_main_~node~1#1.base_11| Int) (v_ArrVal_588 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_11| 1) |v_ULTIMATE.start_main_~item~0#1.base_10|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_11|) 0)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~1#1.base_11| v_ArrVal_588))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_10| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_10|) 0 |v_ULTIMATE.start_main_~node~1#1.base_11|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)))) is different from false [2021-12-27 23:46:11,400 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-27 23:46:11,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2021-12-27 23:46:11,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:46:11,408 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:46:11,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 157 [2021-12-27 23:46:11,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 138 [2021-12-27 23:46:11,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2021-12-27 23:46:11,981 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-27 23:46:11,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-12-27 23:46:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-27 23:46:11,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918620380] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:46:11,996 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:46:11,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2021-12-27 23:46:11,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640986041] [2021-12-27 23:46:11,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:11,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-27 23:46:11,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:11,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-27 23:46:11,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=485, Unknown=2, NotChecked=90, Total=650 [2021-12-27 23:46:11,998 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:13,109 INFO L93 Difference]: Finished difference Result 351 states and 437 transitions. [2021-12-27 23:46:13,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-27 23:46:13,109 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-27 23:46:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:13,111 INFO L225 Difference]: With dead ends: 351 [2021-12-27 23:46:13,111 INFO L226 Difference]: Without dead ends: 348 [2021-12-27 23:46:13,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=977, Unknown=4, NotChecked=138, Total=1406 [2021-12-27 23:46:13,112 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 997 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 665 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:13,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1001 Valid, 1368 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 688 Invalid, 0 Unknown, 665 Unchecked, 0.4s Time] [2021-12-27 23:46:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-12-27 23:46:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 181. [2021-12-27 23:46:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 167 states have (on average 1.1916167664670658) internal successors, (199), 178 states have internal predecessors, (199), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-27 23:46:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 215 transitions. [2021-12-27 23:46:13,126 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 215 transitions. Word has length 44 [2021-12-27 23:46:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:13,127 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 215 transitions. [2021-12-27 23:46:13,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 215 transitions. [2021-12-27 23:46:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-27 23:46:13,128 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:13,128 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:13,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-27 23:46:13,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-27 23:46:13,344 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:13,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash 186164471, now seen corresponding path program 1 times [2021-12-27 23:46:13,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:13,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364176460] [2021-12-27 23:46:13,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:13,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:13,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:13,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364176460] [2021-12-27 23:46:13,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364176460] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:13,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350020337] [2021-12-27 23:46:13,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:13,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:13,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:13,541 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:46:13,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-27 23:46:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:13,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-27 23:46:13,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:13,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-27 23:46:13,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:13,759 INFO L387 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 16 treesize of output 17 [2021-12-27 23:46:13,776 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-27 23:46:13,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-27 23:46:13,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-27 23:46:13,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:13,857 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-27 23:46:13,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2021-12-27 23:46:13,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:13,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-27 23:46:14,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:14,285 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:46:14,286 INFO L387 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 3 case distinctions, treesize of input 44 treesize of output 27 [2021-12-27 23:46:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:14,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:15,358 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) is different from false [2021-12-27 23:46:15,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_695 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_695))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) is different from false [2021-12-27 23:46:15,442 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-27 23:46:15,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2021-12-27 23:46:15,450 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:46:15,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 309 [2021-12-27 23:46:15,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 670 treesize of output 646 [2021-12-27 23:46:15,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 115 [2021-12-27 23:46:15,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-12-27 23:46:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-27 23:46:15,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350020337] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:46:15,672 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:46:15,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 25 [2021-12-27 23:46:15,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796924337] [2021-12-27 23:46:15,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:15,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-27 23:46:15,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:15,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-27 23:46:15,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=440, Unknown=2, NotChecked=86, Total=600 [2021-12-27 23:46:15,674 INFO L87 Difference]: Start difference. First operand 181 states and 215 transitions. Second operand has 25 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:15,733 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~node~1#1.offset| 0) (not (= |c_ULTIMATE.start_main_~node~1#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_695 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_695))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~node~1#1.base| 0))) is different from false [2021-12-27 23:46:15,738 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~node~1#1.offset| 0) (not (= |c_ULTIMATE.start_main_~node~1#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) 0) 0)) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_695 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_695))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) (not (= |c_ULTIMATE.start_main_~node~1#1.base| 0))) is different from false [2021-12-27 23:46:16,603 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~node~1#1.offset| 0) (not (= |c_ULTIMATE.start_main_~node~1#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) (not (= |c_ULTIMATE.start_main_~node~1#1.base| 0))) is different from false [2021-12-27 23:46:16,637 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse4 (select .cse1 .cse3)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~node~1#1.offset| 0) (not (= |c_ULTIMATE.start_main_~node~1#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select .cse1 0) 0)) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_695 (Array Int Int))) (not (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_695))) (store .cse2 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse2 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) .cse3) 0) (not (= (select (select |c_#memory_$Pointer$.base| .cse4) 0) 0)) (= (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~node~1#1.base| 0)) (not (= .cse4 .cse0))))) is different from false [2021-12-27 23:46:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:17,130 INFO L93 Difference]: Finished difference Result 231 states and 275 transitions. [2021-12-27 23:46:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-27 23:46:17,131 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-27 23:46:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:17,132 INFO L225 Difference]: With dead ends: 231 [2021-12-27 23:46:17,132 INFO L226 Difference]: Without dead ends: 228 [2021-12-27 23:46:17,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=176, Invalid=772, Unknown=6, NotChecked=378, Total=1332 [2021-12-27 23:46:17,133 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 372 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:17,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 1306 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 613 Invalid, 0 Unknown, 480 Unchecked, 0.3s Time] [2021-12-27 23:46:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-12-27 23:46:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 188. [2021-12-27 23:46:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 174 states have (on average 1.1839080459770115) internal successors, (206), 185 states have internal predecessors, (206), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-27 23:46:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 222 transitions. [2021-12-27 23:46:17,146 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 222 transitions. Word has length 44 [2021-12-27 23:46:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:17,147 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 222 transitions. [2021-12-27 23:46:17,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 222 transitions. [2021-12-27 23:46:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-27 23:46:17,148 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:17,148 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:17,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-27 23:46:17,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:17,364 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:17,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:17,364 INFO L85 PathProgramCache]: Analyzing trace with hash -498608819, now seen corresponding path program 1 times [2021-12-27 23:46:17,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:17,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855852011] [2021-12-27 23:46:17,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:17,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-27 23:46:17,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:17,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855852011] [2021-12-27 23:46:17,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855852011] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:17,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:17,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:46:17,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580477539] [2021-12-27 23:46:17,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:17,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:46:17,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:46:17,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:46:17,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:46:17,406 INFO L87 Difference]: Start difference. First operand 188 states and 222 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:17,469 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2021-12-27 23:46:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:46:17,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-27 23:46:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:17,471 INFO L225 Difference]: With dead ends: 190 [2021-12-27 23:46:17,471 INFO L226 Difference]: Without dead ends: 153 [2021-12-27 23:46:17,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:46:17,472 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:17,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:46:17,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-27 23:46:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-12-27 23:46:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.1928571428571428) internal successors, (167), 150 states have internal predecessors, (167), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-27 23:46:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 182 transitions. [2021-12-27 23:46:17,483 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 182 transitions. Word has length 45 [2021-12-27 23:46:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:17,483 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 182 transitions. [2021-12-27 23:46:17,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 182 transitions. [2021-12-27 23:46:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-27 23:46:17,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:17,484 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:17,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-27 23:46:17,484 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:17,484 INFO L85 PathProgramCache]: Analyzing trace with hash -636511633, now seen corresponding path program 1 times [2021-12-27 23:46:17,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:46:17,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417790543] [2021-12-27 23:46:17,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:17,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:46:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:17,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:46:17,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417790543] [2021-12-27 23:46:17,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417790543] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:46:17,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630266793] [2021-12-27 23:46:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:17,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:17,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:17,885 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 23:46:17,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-27 23:46:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:17,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 93 conjunts are in the unsatisfiable core [2021-12-27 23:46:17,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:18,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-27 23:46:18,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:18,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-27 23:46:18,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:18,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-27 23:46:18,162 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-27 23:46:18,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-27 23:46:18,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-27 23:46:18,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-27 23:46:18,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:18,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:46:18,284 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-27 23:46:18,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2021-12-27 23:46:18,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:18,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:46:18,300 INFO L353 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2021-12-27 23:46:18,300 INFO L387 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 43 treesize of output 49 [2021-12-27 23:46:19,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:19,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:46:19,538 INFO L353 Elim1Store]: treesize reduction 93, result has 13.1 percent of original size [2021-12-27 23:46:19,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 129 treesize of output 80 [2021-12-27 23:46:19,550 INFO L353 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-12-27 23:46:19,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 28 [2021-12-27 23:46:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:19,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:22,193 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_833 Int)) (let ((.cse11 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse9 (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.offset|) .cse11 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse10 (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_833) .cse11 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| .cse10)) (.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base| .cse9))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse3 (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse1 (select .cse10 |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse2 (select .cse9 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (= (select .cse3 .cse4) 0) (= (select .cse5 .cse4) 0))) (let ((.cse7 (select .cse3 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse8 (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select (select .cse6 .cse7) .cse8) 0) (= (select (select .cse0 .cse7) .cse8) 0))) (not (= (select (select .cse6 .cse1) .cse2) 0)))))))) is different from false [2021-12-27 23:46:22,433 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_829 (Array Int Int)) (v_ArrVal_833 Int) (v_ArrVal_830 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_830)) (.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_829))) (let ((.cse9 (store (store (select .cse11 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.offset|) 4 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse10 (store (store (select .cse12 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_833) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse0 (store .cse12 |ULTIMATE.start_main_~item~0#1.base| .cse10)) (.cse6 (store .cse11 |ULTIMATE.start_main_~item~0#1.base| .cse9))) (let ((.cse1 (select .cse10 0)) (.cse2 (select .cse9 0)) (.cse5 (select .cse6 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse3 (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (= (select .cse3 .cse4) 0) (= (select .cse5 .cse4) 0))) (not (= (select (select .cse6 .cse1) .cse2) 0)) (let ((.cse7 (select .cse3 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse8 (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select (select .cse0 .cse7) .cse8) 0) (= (select (select .cse6 .cse7) .cse8) 0))))))))) is different from false [2021-12-27 23:46:24,181 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-27 23:46:24,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 601 treesize of output 463 [2021-12-27 23:46:24,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:46:24,192 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:46:24,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 445 treesize of output 307 [2021-12-27 23:46:24,379 INFO L353 Elim1Store]: treesize reduction 184, result has 47.6 percent of original size [2021-12-27 23:46:24,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 4657 treesize of output 4527 [2021-12-27 23:46:24,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:24,727 INFO L353 Elim1Store]: treesize reduction 92, result has 72.7 percent of original size [2021-12-27 23:46:24,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 61369 treesize of output 57241 [2021-12-27 23:46:25,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:46:25,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:25,238 INFO L353 Elim1Store]: treesize reduction 16, result has 92.4 percent of original size [2021-12-27 23:46:25,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 102468 treesize of output 95354 [2021-12-27 23:46:28,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:28,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:46:28,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:28,727 INFO L353 Elim1Store]: treesize reduction 16, result has 92.4 percent of original size [2021-12-27 23:46:28,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 111331 treesize of output 106541 [2021-12-27 23:46:30,294 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2021-12-27 23:46:30,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:30,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:46:30,512 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) 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.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2021-12-27 23:46:30,514 INFO L158 Benchmark]: Toolchain (without parser) took 27963.86ms. Allocated memory was 71.3MB in the beginning and 704.6MB in the end (delta: 633.3MB). Free memory was 45.3MB in the beginning and 652.8MB in the end (delta: -607.5MB). Peak memory consumption was 422.4MB. Max. memory is 16.1GB. [2021-12-27 23:46:30,514 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 50.3MB. Free memory was 32.4MB in the beginning and 32.4MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:46:30,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.95ms. Allocated memory is still 71.3MB. Free memory was 45.1MB in the beginning and 46.5MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-27 23:46:30,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.00ms. Allocated memory is still 71.3MB. Free memory was 46.3MB in the beginning and 43.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:46:30,514 INFO L158 Benchmark]: Boogie Preprocessor took 55.18ms. Allocated memory is still 71.3MB. Free memory was 43.7MB in the beginning and 41.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:46:30,515 INFO L158 Benchmark]: RCFGBuilder took 445.42ms. Allocated memory is still 71.3MB. Free memory was 41.3MB in the beginning and 36.5MB in the end (delta: 4.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2021-12-27 23:46:30,515 INFO L158 Benchmark]: TraceAbstraction took 26980.37ms. Allocated memory was 71.3MB in the beginning and 704.6MB in the end (delta: 633.3MB). Free memory was 35.9MB in the beginning and 652.8MB in the end (delta: -616.9MB). Peak memory consumption was 411.4MB. Max. memory is 16.1GB. [2021-12-27 23:46:30,515 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.23ms. Allocated memory is still 50.3MB. Free memory was 32.4MB in the beginning and 32.4MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.95ms. Allocated memory is still 71.3MB. Free memory was 45.1MB in the beginning and 46.5MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.00ms. Allocated memory is still 71.3MB. Free memory was 46.3MB in the beginning and 43.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.18ms. Allocated memory is still 71.3MB. Free memory was 43.7MB in the beginning and 41.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 445.42ms. Allocated memory is still 71.3MB. Free memory was 41.3MB in the beginning and 36.5MB in the end (delta: 4.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 26980.37ms. Allocated memory was 71.3MB in the beginning and 704.6MB in the end (delta: 633.3MB). Free memory was 35.9MB in the beginning and 652.8MB in the end (delta: -616.9MB). Peak memory consumption was 411.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-27 23:46:30,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-2.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 e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 23:46:32,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 23:46:32,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 23:46:32,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 23:46:32,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 23:46:32,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 23:46:32,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 23:46:32,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 23:46:32,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 23:46:32,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 23:46:32,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 23:46:32,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 23:46:32,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 23:46:32,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 23:46:32,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 23:46:32,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 23:46:32,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 23:46:32,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 23:46:32,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 23:46:32,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 23:46:32,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 23:46:32,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 23:46:32,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 23:46:32,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 23:46:32,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 23:46:32,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 23:46:32,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 23:46:32,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 23:46:32,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 23:46:32,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 23:46:32,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 23:46:32,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 23:46:32,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 23:46:32,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 23:46:32,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 23:46:32,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 23:46:32,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 23:46:32,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 23:46:32,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 23:46:32,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 23:46:32,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 23:46:32,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-27 23:46:32,293 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 23:46:32,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 23:46:32,293 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 23:46:32,293 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 23:46:32,294 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 23:46:32,294 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 23:46:32,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 23:46:32,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 23:46:32,295 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 23:46:32,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 23:46:32,296 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 23:46:32,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 23:46:32,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 23:46:32,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 23:46:32,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 23:46:32,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 23:46:32,297 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-27 23:46:32,297 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-27 23:46:32,297 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-27 23:46:32,297 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 23:46:32,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 23:46:32,297 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 23:46:32,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 23:46:32,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 23:46:32,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 23:46:32,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 23:46:32,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:46:32,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 23:46:32,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 23:46:32,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 23:46:32,298 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-27 23:46:32,298 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-27 23:46:32,298 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 23:46:32,298 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 23:46:32,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 23:46:32,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-27 23:46:32,299 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 -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2021-12-27 23:46:32,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 23:46:32,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 23:46:32,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 23:46:32,607 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 23:46:32,607 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 23:46:32,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2021-12-27 23:46:32,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64dad5b1e/2ca9d30fceee4a76b13c8b7f603ec935/FLAGa3df30e33 [2021-12-27 23:46:33,024 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 23:46:33,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2021-12-27 23:46:33,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64dad5b1e/2ca9d30fceee4a76b13c8b7f603ec935/FLAGa3df30e33 [2021-12-27 23:46:33,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64dad5b1e/2ca9d30fceee4a76b13c8b7f603ec935 [2021-12-27 23:46:33,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 23:46:33,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 23:46:33,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 23:46:33,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 23:46:33,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 23:46:33,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:46:33" (1/1) ... [2021-12-27 23:46:33,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d3168b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33, skipping insertion in model container [2021-12-27 23:46:33,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:46:33" (1/1) ... [2021-12-27 23:46:33,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 23:46:33,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 23:46:33,678 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-manipulation/merge_sort-2.i[22632,22645] [2021-12-27 23:46:33,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:46:33,731 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 23:46:33,776 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-manipulation/merge_sort-2.i[22632,22645] [2021-12-27 23:46:33,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:46:33,826 INFO L208 MainTranslator]: Completed translation [2021-12-27 23:46:33,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33 WrapperNode [2021-12-27 23:46:33,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 23:46:33,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 23:46:33,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 23:46:33,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 23:46:33,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33" (1/1) ... [2021-12-27 23:46:33,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33" (1/1) ... [2021-12-27 23:46:33,888 INFO L137 Inliner]: procedures = 128, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 284 [2021-12-27 23:46:33,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 23:46:33,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 23:46:33,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 23:46:33,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 23:46:33,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33" (1/1) ... [2021-12-27 23:46:33,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33" (1/1) ... [2021-12-27 23:46:33,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33" (1/1) ... [2021-12-27 23:46:33,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33" (1/1) ... [2021-12-27 23:46:33,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33" (1/1) ... [2021-12-27 23:46:33,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33" (1/1) ... [2021-12-27 23:46:33,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33" (1/1) ... [2021-12-27 23:46:33,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 23:46:33,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 23:46:33,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 23:46:33,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 23:46:33,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33" (1/1) ... [2021-12-27 23:46:33,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:46:33,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:46:34,005 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) [2021-12-27 23:46:34,055 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 [2021-12-27 23:46:34,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-27 23:46:34,103 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2021-12-27 23:46:34,103 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2021-12-27 23:46:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-12-27 23:46:34,104 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-12-27 23:46:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-27 23:46:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 23:46:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-27 23:46:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-27 23:46:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-27 23:46:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-27 23:46:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 23:46:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-27 23:46:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 23:46:34,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 23:46:34,262 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 23:46:34,263 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 23:46:34,730 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 23:46:34,735 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 23:46:34,735 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2021-12-27 23:46:34,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:46:34 BoogieIcfgContainer [2021-12-27 23:46:34,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 23:46:34,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 23:46:34,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 23:46:34,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 23:46:34,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:46:33" (1/3) ... [2021-12-27 23:46:34,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ea8db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:46:34, skipping insertion in model container [2021-12-27 23:46:34,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:46:33" (2/3) ... [2021-12-27 23:46:34,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ea8db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:46:34, skipping insertion in model container [2021-12-27 23:46:34,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:46:34" (3/3) ... [2021-12-27 23:46:34,742 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2021-12-27 23:46:34,745 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 23:46:34,745 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 23:46:34,776 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 23:46:34,794 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 23:46:34,795 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 23:46:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 92 states have internal predecessors, (138), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-27 23:46:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-27 23:46:34,815 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:34,816 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:34,816 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:34,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2116504326, now seen corresponding path program 1 times [2021-12-27 23:46:34,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:34,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056924092] [2021-12-27 23:46:34,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:34,833 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:34,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:34,835 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) [2021-12-27 23:46:34,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-27 23:46:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:34,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-27 23:46:34,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:34,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:34,977 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:34,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056924092] [2021-12-27 23:46:34,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056924092] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:34,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:34,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 23:46:34,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286963368] [2021-12-27 23:46:34,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:34,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 23:46:34,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:35,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 23:46:35,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:46:35,005 INFO L87 Difference]: Start difference. First operand has 95 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 92 states have internal predecessors, (138), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:35,037 INFO L93 Difference]: Finished difference Result 186 states and 333 transitions. [2021-12-27 23:46:35,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 23:46:35,038 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-27 23:46:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:35,044 INFO L225 Difference]: With dead ends: 186 [2021-12-27 23:46:35,044 INFO L226 Difference]: Without dead ends: 86 [2021-12-27 23:46:35,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:46:35,050 INFO L933 BasicCegarLoop]: 118 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, 118 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 [2021-12-27 23:46:35,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:46:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-27 23:46:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-27 23:46:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 83 states have internal predecessors, (92), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2021-12-27 23:46:35,077 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 7 [2021-12-27 23:46:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:35,077 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2021-12-27 23:46:35,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2021-12-27 23:46:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-27 23:46:35,078 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:35,078 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:35,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-27 23:46:35,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:35,287 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:35,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:35,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2099880948, now seen corresponding path program 1 times [2021-12-27 23:46:35,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:35,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364299618] [2021-12-27 23:46:35,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:35,289 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:35,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:35,295 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) [2021-12-27 23:46:35,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-27 23:46:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:35,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 23:46:35,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:35,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:35,434 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:35,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364299618] [2021-12-27 23:46:35,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364299618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:35,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:35,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 23:46:35,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265432085] [2021-12-27 23:46:35,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:35,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 23:46:35,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 23:46:35,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 23:46:35,437 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:35,469 INFO L93 Difference]: Finished difference Result 170 states and 216 transitions. [2021-12-27 23:46:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 23:46:35,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-27 23:46:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:35,471 INFO L225 Difference]: With dead ends: 170 [2021-12-27 23:46:35,471 INFO L226 Difference]: Without dead ends: 91 [2021-12-27 23:46:35,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 23:46:35,472 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 4 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:35,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:46:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-27 23:46:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2021-12-27 23:46:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2021-12-27 23:46:35,480 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2021-12-27 23:46:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:35,480 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2021-12-27 23:46:35,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2021-12-27 23:46:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 23:46:35,481 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:35,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:35,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:35,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:35,689 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:35,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:35,689 INFO L85 PathProgramCache]: Analyzing trace with hash -404579866, now seen corresponding path program 1 times [2021-12-27 23:46:35,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:35,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082325229] [2021-12-27 23:46:35,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:35,690 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:35,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:35,691 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) [2021-12-27 23:46:35,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-27 23:46:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:35,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 23:46:35,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:35,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:35,796 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:35,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082325229] [2021-12-27 23:46:35,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082325229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:35,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:35,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:46:35,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090802776] [2021-12-27 23:46:35,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:35,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:46:35,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:35,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:46:35,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:46:35,798 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:35,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:35,954 INFO L93 Difference]: Finished difference Result 235 states and 308 transitions. [2021-12-27 23:46:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 23:46:35,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-27 23:46:35,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:35,956 INFO L225 Difference]: With dead ends: 235 [2021-12-27 23:46:35,956 INFO L226 Difference]: Without dead ends: 230 [2021-12-27 23:46:35,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-27 23:46:35,957 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 516 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:35,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 274 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:46:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-27 23:46:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 90. [2021-12-27 23:46:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 87 states have internal predecessors, (97), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2021-12-27 23:46:35,968 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 12 [2021-12-27 23:46:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:35,968 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2021-12-27 23:46:35,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2021-12-27 23:46:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-27 23:46:35,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:35,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:35,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:36,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:36,177 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:36,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1696064914, now seen corresponding path program 1 times [2021-12-27 23:46:36,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:36,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995398169] [2021-12-27 23:46:36,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:36,178 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:36,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:36,179 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) [2021-12-27 23:46:36,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-27 23:46:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:36,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-27 23:46:36,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:36,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2021-12-27 23:46:36,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2021-12-27 23:46:36,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:36,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:36,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:36,633 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:36,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995398169] [2021-12-27 23:46:36,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995398169] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:46:36,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:46:36,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-12-27 23:46:36,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820948140] [2021-12-27 23:46:36,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:36,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 23:46:36,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:36,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 23:46:36,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-27 23:46:36,642 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:37,891 INFO L93 Difference]: Finished difference Result 276 states and 357 transitions. [2021-12-27 23:46:37,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 23:46:37,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-27 23:46:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:37,893 INFO L225 Difference]: With dead ends: 276 [2021-12-27 23:46:37,894 INFO L226 Difference]: Without dead ends: 273 [2021-12-27 23:46:37,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-27 23:46:37,894 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 500 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:37,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 441 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-27 23:46:37,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-12-27 23:46:37,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 104. [2021-12-27 23:46:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 101 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 129 transitions. [2021-12-27 23:46:37,917 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 129 transitions. Word has length 19 [2021-12-27 23:46:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:37,917 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 129 transitions. [2021-12-27 23:46:37,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 129 transitions. [2021-12-27 23:46:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-27 23:46:37,918 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:37,918 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:37,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:38,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:38,119 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:38,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2021480904, now seen corresponding path program 1 times [2021-12-27 23:46:38,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:38,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444432081] [2021-12-27 23:46:38,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:38,120 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:38,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:38,123 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) [2021-12-27 23:46:38,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-27 23:46:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:38,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-27 23:46:38,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:38,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2021-12-27 23:46:38,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2021-12-27 23:46:38,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:38,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:38,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:38,486 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:38,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444432081] [2021-12-27 23:46:38,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444432081] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:46:38,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:46:38,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-12-27 23:46:38,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704744840] [2021-12-27 23:46:38,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:38,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 23:46:38,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:38,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 23:46:38,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-27 23:46:38,487 INFO L87 Difference]: Start difference. First operand 104 states and 129 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:40,081 INFO L93 Difference]: Finished difference Result 264 states and 340 transitions. [2021-12-27 23:46:40,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 23:46:40,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-27 23:46:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:40,083 INFO L225 Difference]: With dead ends: 264 [2021-12-27 23:46:40,083 INFO L226 Difference]: Without dead ends: 188 [2021-12-27 23:46:40,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-27 23:46:40,084 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 151 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:40,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 566 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-27 23:46:40,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-27 23:46:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 104. [2021-12-27 23:46:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 101 states have internal predecessors, (112), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2021-12-27 23:46:40,091 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 19 [2021-12-27 23:46:40,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:40,092 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2021-12-27 23:46:40,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2021-12-27 23:46:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-27 23:46:40,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:40,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:40,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-27 23:46:40,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:40,302 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:40,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1594907966, now seen corresponding path program 1 times [2021-12-27 23:46:40,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:40,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763527690] [2021-12-27 23:46:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:40,304 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:40,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:40,305 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) [2021-12-27 23:46:40,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-27 23:46:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:40,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-27 23:46:40,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:40,446 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-27 23:46:40,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2021-12-27 23:46:40,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-27 23:46:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:40,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:40,509 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:40,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763527690] [2021-12-27 23:46:40,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763527690] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:40,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:40,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 23:46:40,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390842004] [2021-12-27 23:46:40,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:40,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 23:46:40,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:40,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 23:46:40,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:46:40,511 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:41,084 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2021-12-27 23:46:41,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:46:41,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-27 23:46:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:41,085 INFO L225 Difference]: With dead ends: 209 [2021-12-27 23:46:41,085 INFO L226 Difference]: Without dead ends: 206 [2021-12-27 23:46:41,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-27 23:46:41,086 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 357 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:41,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 287 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-27 23:46:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-27 23:46:41,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 110. [2021-12-27 23:46:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 107 states have internal predecessors, (119), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2021-12-27 23:46:41,093 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 22 [2021-12-27 23:46:41,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:41,093 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2021-12-27 23:46:41,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2021-12-27 23:46:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-27 23:46:41,094 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:41,094 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:41,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:41,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:41,306 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:41,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1900694176, now seen corresponding path program 2 times [2021-12-27 23:46:41,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:41,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389486655] [2021-12-27 23:46:41,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 23:46:41,307 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:41,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:41,308 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) [2021-12-27 23:46:41,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-27 23:46:41,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-27 23:46:41,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 23:46:41,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-27 23:46:41,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:41,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-27 23:46:41,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-27 23:46:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-27 23:46:41,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:41,451 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:41,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389486655] [2021-12-27 23:46:41,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389486655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:41,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:41,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:46:41,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012716975] [2021-12-27 23:46:41,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:41,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:46:41,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:41,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:46:41,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:46:41,453 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:42,011 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2021-12-27 23:46:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:46:42,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-27 23:46:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:42,012 INFO L225 Difference]: With dead ends: 137 [2021-12-27 23:46:42,012 INFO L226 Difference]: Without dead ends: 134 [2021-12-27 23:46:42,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:46:42,013 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:42,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 288 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-27 23:46:42,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-27 23:46:42,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 105. [2021-12-27 23:46:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 102 states have internal predecessors, (113), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2021-12-27 23:46:42,025 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 24 [2021-12-27 23:46:42,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:42,026 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2021-12-27 23:46:42,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2021-12-27 23:46:42,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-27 23:46:42,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:42,029 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:42,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:42,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:42,237 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:42,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:42,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2068857130, now seen corresponding path program 2 times [2021-12-27 23:46:42,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:42,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286569853] [2021-12-27 23:46:42,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 23:46:42,238 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:42,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:42,240 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) [2021-12-27 23:46:42,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-27 23:46:42,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-27 23:46:42,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 23:46:42,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-27 23:46:42,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:42,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-12-27 23:46:42,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-27 23:46:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-27 23:46:42,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:42,390 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:42,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286569853] [2021-12-27 23:46:42,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286569853] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:42,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:42,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:46:42,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353423984] [2021-12-27 23:46:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:42,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:46:42,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:46:42,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:46:42,391 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:42,836 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2021-12-27 23:46:42,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:46:42,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-27 23:46:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:42,837 INFO L225 Difference]: With dead ends: 107 [2021-12-27 23:46:42,837 INFO L226 Difference]: Without dead ends: 104 [2021-12-27 23:46:42,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:46:42,837 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 11 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:42,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 307 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-27 23:46:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-27 23:46:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-27 23:46:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 101 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2021-12-27 23:46:42,847 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 24 [2021-12-27 23:46:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:42,848 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2021-12-27 23:46:42,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2021-12-27 23:46:42,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-27 23:46:42,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:42,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:42,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:43,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:43,049 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:43,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:43,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1214031067, now seen corresponding path program 1 times [2021-12-27 23:46:43,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:43,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144581697] [2021-12-27 23:46:43,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:43,050 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:43,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:43,051 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) [2021-12-27 23:46:43,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-27 23:46:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:43,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-27 23:46:43,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:43,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-27 23:46:43,192 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-27 23:46:43,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-27 23:46:43,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:43,199 INFO L387 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 16 treesize of output 17 [2021-12-27 23:46:43,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:43,209 INFO L387 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 16 treesize of output 17 [2021-12-27 23:46:43,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2021-12-27 23:46:43,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2021-12-27 23:46:43,483 INFO L353 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2021-12-27 23:46:43,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2021-12-27 23:46:43,508 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-27 23:46:43,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2021-12-27 23:46:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:43,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:43,536 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:43,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144581697] [2021-12-27 23:46:43,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144581697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:43,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:43,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 23:46:43,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007606297] [2021-12-27 23:46:43,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:43,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:46:43,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:43,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:46:43,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:46:43,539 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:45,497 INFO L93 Difference]: Finished difference Result 271 states and 344 transitions. [2021-12-27 23:46:45,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 23:46:45,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-27 23:46:45,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:45,498 INFO L225 Difference]: With dead ends: 271 [2021-12-27 23:46:45,499 INFO L226 Difference]: Without dead ends: 268 [2021-12-27 23:46:45,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-27 23:46:45,499 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 529 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:45,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 322 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-27 23:46:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-12-27 23:46:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 107. [2021-12-27 23:46:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 104 states have internal predecessors, (115), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2021-12-27 23:46:45,510 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 25 [2021-12-27 23:46:45,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:45,511 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2021-12-27 23:46:45,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2021-12-27 23:46:45,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-27 23:46:45,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:45,512 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:45,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-27 23:46:45,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:45,723 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:45,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash 361371631, now seen corresponding path program 1 times [2021-12-27 23:46:45,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:45,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038562916] [2021-12-27 23:46:45,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:45,725 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:45,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:45,726 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) [2021-12-27 23:46:45,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-27 23:46:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:45,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-27 23:46:45,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:45,864 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-27 23:46:45,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2021-12-27 23:46:45,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-27 23:46:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 23:46:45,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:45,925 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:45,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038562916] [2021-12-27 23:46:45,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038562916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:45,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:45,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 23:46:45,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766890195] [2021-12-27 23:46:45,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:45,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 23:46:45,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:45,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 23:46:45,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:46:45,927 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:46,754 INFO L93 Difference]: Finished difference Result 199 states and 243 transitions. [2021-12-27 23:46:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:46:46,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-27 23:46:46,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:46,756 INFO L225 Difference]: With dead ends: 199 [2021-12-27 23:46:46,756 INFO L226 Difference]: Without dead ends: 196 [2021-12-27 23:46:46,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-27 23:46:46,756 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 341 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:46,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 275 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-27 23:46:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-27 23:46:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 113. [2021-12-27 23:46:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 110 states have internal predecessors, (121), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2021-12-27 23:46:46,769 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 27 [2021-12-27 23:46:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:46,769 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2021-12-27 23:46:46,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2021-12-27 23:46:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-27 23:46:46,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:46,772 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:46,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:46,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:46,985 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:46,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2027066889, now seen corresponding path program 1 times [2021-12-27 23:46:46,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:46,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715879922] [2021-12-27 23:46:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:46,987 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:46,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:46,988 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) [2021-12-27 23:46:46,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-27 23:46:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:47,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-27 23:46:47,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:47,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-27 23:46:47,193 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-27 23:46:47,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-27 23:46:47,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:47,204 INFO L387 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 16 treesize of output 17 [2021-12-27 23:46:47,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:47,213 INFO L387 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 16 treesize of output 17 [2021-12-27 23:46:47,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:47,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2021-12-27 23:46:47,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:46:47,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2021-12-27 23:46:47,482 INFO L353 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2021-12-27 23:46:47,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2021-12-27 23:46:47,490 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-27 23:46:47,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2021-12-27 23:46:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 23:46:47,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:47,508 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:47,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715879922] [2021-12-27 23:46:47,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715879922] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:47,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:47,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 23:46:47,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064411244] [2021-12-27 23:46:47,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:47,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:46:47,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:47,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:46:47,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:46:47,509 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:49,698 INFO L93 Difference]: Finished difference Result 269 states and 340 transitions. [2021-12-27 23:46:49,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 23:46:49,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-27 23:46:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:49,703 INFO L225 Difference]: With dead ends: 269 [2021-12-27 23:46:49,703 INFO L226 Difference]: Without dead ends: 266 [2021-12-27 23:46:49,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-27 23:46:49,707 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 521 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:49,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 322 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-27 23:46:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-27 23:46:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 116. [2021-12-27 23:46:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.2156862745098038) internal successors, (124), 113 states have internal predecessors, (124), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2021-12-27 23:46:49,717 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 30 [2021-12-27 23:46:49,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:49,717 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2021-12-27 23:46:49,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2021-12-27 23:46:49,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-27 23:46:49,718 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:49,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:49,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:49,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:49,927 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1330919514, now seen corresponding path program 1 times [2021-12-27 23:46:49,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:49,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769422178] [2021-12-27 23:46:49,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:49,928 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:49,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:49,929 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:46:49,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-27 23:46:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:50,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 23:46:50,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:50,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:50,066 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:50,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769422178] [2021-12-27 23:46:50,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769422178] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:50,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:50,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:46:50,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469414491] [2021-12-27 23:46:50,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:50,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:46:50,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:50,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:46:50,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:46:50,067 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:50,143 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2021-12-27 23:46:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:46:50,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-27 23:46:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:50,144 INFO L225 Difference]: With dead ends: 154 [2021-12-27 23:46:50,144 INFO L226 Difference]: Without dead ends: 151 [2021-12-27 23:46:50,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:46:50,145 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 201 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:50,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 272 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:46:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-27 23:46:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 120. [2021-12-27 23:46:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 117 states have internal predecessors, (129), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2021-12-27 23:46:50,157 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 31 [2021-12-27 23:46:50,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:50,157 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2021-12-27 23:46:50,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2021-12-27 23:46:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-27 23:46:50,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:50,158 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:50,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:50,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:50,359 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:50,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:50,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1708376279, now seen corresponding path program 1 times [2021-12-27 23:46:50,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:50,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232237807] [2021-12-27 23:46:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:50,361 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:50,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:50,362 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:46:50,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-27 23:46:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:50,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-27 23:46:50,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:50,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2021-12-27 23:46:50,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2021-12-27 23:46:50,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:50,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:50,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:50,934 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:50,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232237807] [2021-12-27 23:46:50,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232237807] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:46:50,934 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:46:50,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-12-27 23:46:50,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558655816] [2021-12-27 23:46:50,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:50,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 23:46:50,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:50,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 23:46:50,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-27 23:46:50,935 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:51,993 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2021-12-27 23:46:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:46:51,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-27 23:46:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:51,994 INFO L225 Difference]: With dead ends: 171 [2021-12-27 23:46:51,994 INFO L226 Difference]: Without dead ends: 168 [2021-12-27 23:46:51,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-27 23:46:51,995 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 83 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:51,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 441 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-27 23:46:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-27 23:46:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 139. [2021-12-27 23:46:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 125 states have (on average 1.192) internal successors, (149), 136 states have internal predecessors, (149), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2021-12-27 23:46:52,005 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 34 [2021-12-27 23:46:52,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:52,005 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2021-12-27 23:46:52,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2021-12-27 23:46:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-27 23:46:52,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:52,006 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:52,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:52,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:52,216 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:52,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1210378434, now seen corresponding path program 1 times [2021-12-27 23:46:52,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:52,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476425172] [2021-12-27 23:46:52,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:52,217 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:52,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:52,218 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:46:52,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-27 23:46:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:52,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-27 23:46:52,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:52,388 INFO L387 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 14 treesize of output 15 [2021-12-27 23:46:52,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-27 23:46:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:52,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:52,592 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:52,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476425172] [2021-12-27 23:46:52,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476425172] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:46:52,592 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:46:52,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-12-27 23:46:52,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320094213] [2021-12-27 23:46:52,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:52,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 23:46:52,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 23:46:52,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-27 23:46:52,593 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:54,697 INFO L93 Difference]: Finished difference Result 409 states and 534 transitions. [2021-12-27 23:46:54,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 23:46:54,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-27 23:46:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:54,699 INFO L225 Difference]: With dead ends: 409 [2021-12-27 23:46:54,699 INFO L226 Difference]: Without dead ends: 405 [2021-12-27 23:46:54,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-12-27 23:46:54,700 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 1157 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:54,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1159 Valid, 755 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-27 23:46:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-12-27 23:46:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 145. [2021-12-27 23:46:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 131 states have (on average 1.1908396946564885) internal successors, (156), 142 states have internal predecessors, (156), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2021-12-27 23:46:54,713 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 35 [2021-12-27 23:46:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:54,713 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2021-12-27 23:46:54,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:54,713 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2021-12-27 23:46:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-27 23:46:54,718 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:54,719 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:54,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-27 23:46:54,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:54,927 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:54,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:54,928 INFO L85 PathProgramCache]: Analyzing trace with hash 749828415, now seen corresponding path program 1 times [2021-12-27 23:46:54,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:54,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820552098] [2021-12-27 23:46:54,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:54,928 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:54,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:54,929 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:46:54,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-27 23:46:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:55,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-27 23:46:55,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:55,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2021-12-27 23:46:55,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2021-12-27 23:46:55,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:55,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:46:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:55,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:46:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:46:55,387 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:55,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820552098] [2021-12-27 23:46:55,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820552098] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:46:55,387 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:46:55,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-12-27 23:46:55,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921884689] [2021-12-27 23:46:55,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:46:55,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:46:55,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:55,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:46:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:46:55,388 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:55,838 INFO L93 Difference]: Finished difference Result 200 states and 239 transitions. [2021-12-27 23:46:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 23:46:55,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-27 23:46:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:55,839 INFO L225 Difference]: With dead ends: 200 [2021-12-27 23:46:55,839 INFO L226 Difference]: Without dead ends: 159 [2021-12-27 23:46:55,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-27 23:46:55,840 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 40 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:55,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 330 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-27 23:46:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-27 23:46:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2021-12-27 23:46:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 131 states have (on average 1.183206106870229) internal successors, (155), 142 states have internal predecessors, (155), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2021-12-27 23:46:55,851 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 36 [2021-12-27 23:46:55,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:55,852 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2021-12-27 23:46:55,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2021-12-27 23:46:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-27 23:46:55,852 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:55,853 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:55,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-27 23:46:56,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:56,056 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:56,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:56,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1116813069, now seen corresponding path program 1 times [2021-12-27 23:46:56,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:56,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721139854] [2021-12-27 23:46:56,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:46:56,057 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:56,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:56,058 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:46:56,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-27 23:46:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:46:56,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-27 23:46:56,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:56,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-27 23:46:56,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-27 23:46:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 23:46:56,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:56,350 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:56,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721139854] [2021-12-27 23:46:56,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721139854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:56,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:56,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 23:46:56,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185963643] [2021-12-27 23:46:56,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:56,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:46:56,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:56,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:46:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:46:56,351 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:57,786 INFO L93 Difference]: Finished difference Result 188 states and 226 transitions. [2021-12-27 23:46:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:46:57,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-27 23:46:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:57,787 INFO L225 Difference]: With dead ends: 188 [2021-12-27 23:46:57,787 INFO L226 Difference]: Without dead ends: 185 [2021-12-27 23:46:57,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-27 23:46:57,788 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 89 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:57,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 436 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-27 23:46:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-27 23:46:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 157. [2021-12-27 23:46:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 143 states have (on average 1.1818181818181819) internal successors, (169), 154 states have internal predecessors, (169), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 183 transitions. [2021-12-27 23:46:57,805 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 183 transitions. Word has length 37 [2021-12-27 23:46:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:57,805 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 183 transitions. [2021-12-27 23:46:57,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 183 transitions. [2021-12-27 23:46:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-27 23:46:57,806 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:57,806 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:57,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:58,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:58,013 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:58,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:58,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1178426459, now seen corresponding path program 2 times [2021-12-27 23:46:58,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:58,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398692758] [2021-12-27 23:46:58,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 23:46:58,014 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:58,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:58,015 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:46:58,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-27 23:46:58,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-27 23:46:58,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 23:46:58,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-27 23:46:58,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:58,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-27 23:46:58,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-27 23:46:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-27 23:46:58,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:46:58,290 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:46:58,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398692758] [2021-12-27 23:46:58,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398692758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:46:58,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:46:58,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 23:46:58,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233242309] [2021-12-27 23:46:58,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:46:58,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:46:58,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:46:58,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:46:58,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:46:58,292 INFO L87 Difference]: Start difference. First operand 157 states and 183 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:46:59,403 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2021-12-27 23:46:59,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:46:59,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-27 23:46:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:46:59,405 INFO L225 Difference]: With dead ends: 187 [2021-12-27 23:46:59,405 INFO L226 Difference]: Without dead ends: 184 [2021-12-27 23:46:59,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-27 23:46:59,405 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 95 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:46:59,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 436 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-27 23:46:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-27 23:46:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 152. [2021-12-27 23:46:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 138 states have (on average 1.181159420289855) internal successors, (163), 149 states have internal predecessors, (163), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:46:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2021-12-27 23:46:59,423 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 39 [2021-12-27 23:46:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:46:59,424 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2021-12-27 23:46:59,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:46:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2021-12-27 23:46:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-27 23:46:59,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:46:59,425 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:46:59,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-27 23:46:59,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:46:59,632 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:46:59,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:46:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1081270413, now seen corresponding path program 2 times [2021-12-27 23:46:59,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:46:59,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670657793] [2021-12-27 23:46:59,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 23:46:59,633 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:46:59,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:46:59,634 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:46:59,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-27 23:46:59,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 23:46:59,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 23:46:59,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-27 23:46:59,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:46:59,821 INFO L387 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 14 treesize of output 15 [2021-12-27 23:46:59,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-27 23:46:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-27 23:46:59,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:47:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-27 23:47:00,008 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:47:00,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670657793] [2021-12-27 23:47:00,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670657793] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:47:00,008 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:47:00,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-12-27 23:47:00,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396733532] [2021-12-27 23:47:00,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:47:00,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 23:47:00,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:47:00,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 23:47:00,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-27 23:47:00,009 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:47:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:47:01,755 INFO L93 Difference]: Finished difference Result 257 states and 316 transitions. [2021-12-27 23:47:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 23:47:01,755 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-27 23:47:01,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:47:01,756 INFO L225 Difference]: With dead ends: 257 [2021-12-27 23:47:01,756 INFO L226 Difference]: Without dead ends: 194 [2021-12-27 23:47:01,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-12-27 23:47:01,757 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 375 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-27 23:47:01,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 772 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-27 23:47:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-27 23:47:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 138. [2021-12-27 23:47:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.185483870967742) internal successors, (147), 135 states have internal predecessors, (147), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 23:47:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2021-12-27 23:47:01,768 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 41 [2021-12-27 23:47:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:47:01,768 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2021-12-27 23:47:01,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:47:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2021-12-27 23:47:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-27 23:47:01,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:47:01,769 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:47:01,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-12-27 23:47:01,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:47:01,969 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:47:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:47:01,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1304250571, now seen corresponding path program 1 times [2021-12-27 23:47:01,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:47:01,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636948710] [2021-12-27 23:47:01,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:47:01,970 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:47:01,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:47:01,971 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:47:01,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-27 23:47:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:47:02,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-27 23:47:02,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:47:02,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-27 23:47:02,155 INFO L387 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 14 treesize of output 15 [2021-12-27 23:47:02,178 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-27 23:47:02,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2021-12-27 23:47:02,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-27 23:47:02,272 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-27 23:47:02,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2021-12-27 23:47:02,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2021-12-27 23:47:02,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:47:02,679 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:47:02,679 INFO L387 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 3 case distinctions, treesize of input 44 treesize of output 27 [2021-12-27 23:47:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:47:02,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:47:04,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-27 23:47:04,919 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_667))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-27 23:47:05,335 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-27 23:47:05,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2021-12-27 23:47:05,350 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:47:05,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 157 [2021-12-27 23:47:05,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 206 [2021-12-27 23:47:05,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 98 [2021-12-27 23:47:05,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 115 [2021-12-27 23:47:05,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2021-12-27 23:47:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-27 23:47:05,701 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:47:05,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636948710] [2021-12-27 23:47:05,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636948710] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:47:05,701 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:47:05,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-12-27 23:47:05,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634079470] [2021-12-27 23:47:05,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:47:05,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-27 23:47:05,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:47:05,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-27 23:47:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=202, Unknown=3, NotChecked=58, Total=306 [2021-12-27 23:47:05,702 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:47:05,992 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| (_ bv0 32))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_667))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))) is different from false [2021-12-27 23:47:06,118 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~node~1#1.base| (_ bv0 32))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_667))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|))) is different from false [2021-12-27 23:47:08,167 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| (_ bv0 32))) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))) is different from false [2021-12-27 23:47:08,307 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (select .cse3 (_ bv0 32))) (.cse2 (select .cse3 (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| (_ bv0 32))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_667))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32)))) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= .cse1 (_ bv0 32))) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| .cse2) (_ bv0 32)))) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|))))) is different from false