./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -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 58eecb02814a6b78cadd872f0ade36a8b32c0833 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -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 58eecb02814a6b78cadd872f0ade36a8b32c0833 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:09:01,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:09:01,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:09:01,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:09:01,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:09:01,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:09:01,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:09:01,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:09:01,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:09:01,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:09:01,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:09:01,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:09:01,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:09:01,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:09:01,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:09:01,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:09:01,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:09:01,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:09:01,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:09:01,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:09:01,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:09:01,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:09:01,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:09:01,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:09:01,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:09:01,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:09:01,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:09:01,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:09:01,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:09:01,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:09:01,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:09:01,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:09:01,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:09:01,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:09:01,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:09:01,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:09:01,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:09:01,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:09:01,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:09:01,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:09:01,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:09:01,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:09:01,656 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:09:01,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:09:01,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:09:01,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:09:01,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:09:01,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:09:01,660 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:09:01,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:09:01,661 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:09:01,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:09:01,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:09:01,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:09:01,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:09:01,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:09:01,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:09:01,663 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:09:01,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:09:01,663 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:09:01,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:09:01,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:09:01,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:09:01,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:09:01,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:09:01,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:09:01,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:09:01,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:09:01,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:09:01,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:09:01,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:09:01,665 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:09:01,665 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 -> 58eecb02814a6b78cadd872f0ade36a8b32c0833 [2021-08-25 20:09:02,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:09:02,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:09:02,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:09:02,038 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:09:02,039 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:09:02,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2021-08-25 20:09:02,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/469e95d17/ee381b0efd06439eb161de5f654bc259/FLAG59149bf4f [2021-08-25 20:09:02,495 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:09:02,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2021-08-25 20:09:02,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/469e95d17/ee381b0efd06439eb161de5f654bc259/FLAG59149bf4f [2021-08-25 20:09:02,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/469e95d17/ee381b0efd06439eb161de5f654bc259 [2021-08-25 20:09:02,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:09:02,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:09:02,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:09:02,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:09:02,528 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:09:02,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:09:02" (1/1) ... [2021-08-25 20:09:02,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b467b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02, skipping insertion in model container [2021-08-25 20:09:02,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:09:02" (1/1) ... [2021-08-25 20:09:02,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:09:02,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:09:02,689 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2021-08-25 20:09:02,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:09:02,717 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:09:02,735 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2021-08-25 20:09:02,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:09:02,777 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:09:02,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02 WrapperNode [2021-08-25 20:09:02,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:09:02,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:09:02,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:09:02,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:09:02,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02" (1/1) ... [2021-08-25 20:09:02,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02" (1/1) ... [2021-08-25 20:09:02,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:09:02,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:09:02,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:09:02,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:09:02,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02" (1/1) ... [2021-08-25 20:09:02,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02" (1/1) ... [2021-08-25 20:09:02,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02" (1/1) ... [2021-08-25 20:09:02,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02" (1/1) ... [2021-08-25 20:09:02,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02" (1/1) ... [2021-08-25 20:09:02,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02" (1/1) ... [2021-08-25 20:09:02,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02" (1/1) ... [2021-08-25 20:09:02,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:09:02,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:09:02,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:09:02,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:09:02,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02" (1/1) ... [2021-08-25 20:09:02,838 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:09:02,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:09:02,858 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-08-25 20:09:02,880 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-08-25 20:09:02,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:09:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:09:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-25 20:09:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:09:02,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:09:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-25 20:09:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-25 20:09:03,114 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:09:03,129 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-25 20:09:03,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:09:03 BoogieIcfgContainer [2021-08-25 20:09:03,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:09:03,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:09:03,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:09:03,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:09:03,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:09:02" (1/3) ... [2021-08-25 20:09:03,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2f459d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:09:03, skipping insertion in model container [2021-08-25 20:09:03,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:09:02" (2/3) ... [2021-08-25 20:09:03,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2f459d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:09:03, skipping insertion in model container [2021-08-25 20:09:03,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:09:03" (3/3) ... [2021-08-25 20:09:03,145 INFO L111 eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2021-08-25 20:09:03,150 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:09:03,168 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:09:03,206 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:09:03,212 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, mConcurrency=FINITE_AUTOMATA, 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-08-25 20:09:03,212 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:09:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-25 20:09:03,228 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:03,228 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:03,231 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:03,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:03,236 INFO L82 PathProgramCache]: Analyzing trace with hash 212076531, now seen corresponding path program 1 times [2021-08-25 20:09:03,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:09:03,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064221295] [2021-08-25 20:09:03,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:09:03,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:09:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:09:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:09:03,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:09:03,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064221295] [2021-08-25 20:09:03,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064221295] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:09:03,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:09:03,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:09:03,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102361588] [2021-08-25 20:09:03,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:09:03,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:09:03,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:09:03,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:09:03,401 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:09:03,431 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2021-08-25 20:09:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:09:03,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-08-25 20:09:03,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:09:03,438 INFO L225 Difference]: With dead ends: 35 [2021-08-25 20:09:03,439 INFO L226 Difference]: Without dead ends: 17 [2021-08-25 20:09:03,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:09:03,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-08-25 20:09:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2021-08-25 20:09:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-08-25 20:09:03,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2021-08-25 20:09:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:09:03,471 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-08-25 20:09:03,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2021-08-25 20:09:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-25 20:09:03,472 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:03,472 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:03,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:09:03,473 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1435974389, now seen corresponding path program 1 times [2021-08-25 20:09:03,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:09:03,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494534921] [2021-08-25 20:09:03,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:09:03,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:09:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:09:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:09:03,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:09:03,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494534921] [2021-08-25 20:09:03,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494534921] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:03,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765584806] [2021-08-25 20:09:03,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:09:03,518 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:09:03,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:09:03,520 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-08-25 20:09:03,531 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-08-25 20:09:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:09:03,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:09:03,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:09:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:09:03,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765584806] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:03,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:09:03,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-25 20:09:03,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229637792] [2021-08-25 20:09:03,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:09:03,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:09:03,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:09:03,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:09:03,684 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:09:03,714 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2021-08-25 20:09:03,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:09:03,715 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-25 20:09:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:09:03,716 INFO L225 Difference]: With dead ends: 25 [2021-08-25 20:09:03,716 INFO L226 Difference]: Without dead ends: 19 [2021-08-25 20:09:03,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:09:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-08-25 20:09:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2021-08-25 20:09:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-08-25 20:09:03,723 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2021-08-25 20:09:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:09:03,723 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-25 20:09:03,723 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-08-25 20:09:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-25 20:09:03,728 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:03,730 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:03,772 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-08-25 20:09:03,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:09:03,957 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:03,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:03,957 INFO L82 PathProgramCache]: Analyzing trace with hash 780776823, now seen corresponding path program 2 times [2021-08-25 20:09:03,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:09:03,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676405477] [2021-08-25 20:09:03,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:09:03,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:09:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:09:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-25 20:09:04,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:09:04,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676405477] [2021-08-25 20:09:04,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676405477] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:09:04,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:09:04,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:09:04,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930526258] [2021-08-25 20:09:04,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:09:04,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:09:04,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:09:04,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:09:04,046 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:09:04,094 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2021-08-25 20:09:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:09:04,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-25 20:09:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:09:04,095 INFO L225 Difference]: With dead ends: 18 [2021-08-25 20:09:04,095 INFO L226 Difference]: Without dead ends: 14 [2021-08-25 20:09:04,096 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:09:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-08-25 20:09:04,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-08-25 20:09:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-08-25 20:09:04,100 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2021-08-25 20:09:04,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:09:04,101 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-08-25 20:09:04,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:04,101 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-08-25 20:09:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-25 20:09:04,102 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:04,102 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:04,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:09:04,102 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:04,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:04,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1564056878, now seen corresponding path program 1 times [2021-08-25 20:09:04,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:09:04,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055788521] [2021-08-25 20:09:04,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:09:04,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:09:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:09:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 20:09:04,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:09:04,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055788521] [2021-08-25 20:09:04,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055788521] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:04,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496918551] [2021-08-25 20:09:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:09:04,168 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:09:04,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:09:04,175 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-08-25 20:09:04,176 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-08-25 20:09:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:09:04,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:09:04,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:09:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 20:09:04,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496918551] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:04,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:09:04,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-25 20:09:04,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38565474] [2021-08-25 20:09:04,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:09:04,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:09:04,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:09:04,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:09:04,276 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:09:04,298 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2021-08-25 20:09:04,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:09:04,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-25 20:09:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:09:04,299 INFO L225 Difference]: With dead ends: 24 [2021-08-25 20:09:04,299 INFO L226 Difference]: Without dead ends: 17 [2021-08-25 20:09:04,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:09:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-08-25 20:09:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-08-25 20:09:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-08-25 20:09:04,303 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2021-08-25 20:09:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:09:04,303 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-08-25 20:09:04,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-08-25 20:09:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-25 20:09:04,304 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:04,304 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:04,334 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-08-25 20:09:04,525 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,SelfDestructingSolverStorable3 [2021-08-25 20:09:04,525 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:04,526 INFO L82 PathProgramCache]: Analyzing trace with hash 71614736, now seen corresponding path program 2 times [2021-08-25 20:09:04,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:09:04,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521397951] [2021-08-25 20:09:04,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:09:04,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:09:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:09:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 20:09:04,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:09:04,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521397951] [2021-08-25 20:09:04,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521397951] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:04,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883683510] [2021-08-25 20:09:04,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 20:09:04,600 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:09:04,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:09:04,602 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-08-25 20:09:04,620 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-08-25 20:09:04,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 20:09:04,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:09:04,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-25 20:09:04,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:09:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 20:09:04,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883683510] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:04,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:09:04,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-25 20:09:04,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877354341] [2021-08-25 20:09:04,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 20:09:04,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:09:04,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 20:09:04,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:09:04,745 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:09:04,778 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2021-08-25 20:09:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:09:04,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-25 20:09:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:09:04,780 INFO L225 Difference]: With dead ends: 26 [2021-08-25 20:09:04,780 INFO L226 Difference]: Without dead ends: 19 [2021-08-25 20:09:04,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 21.6ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:09:04,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-08-25 20:09:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-08-25 20:09:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2021-08-25 20:09:04,796 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2021-08-25 20:09:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:09:04,797 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2021-08-25 20:09:04,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2021-08-25 20:09:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-25 20:09:04,798 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:04,798 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:04,822 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-08-25 20:09:05,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:09:05,013 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:05,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:05,017 INFO L82 PathProgramCache]: Analyzing trace with hash -5994546, now seen corresponding path program 3 times [2021-08-25 20:09:05,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:09:05,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610675579] [2021-08-25 20:09:05,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:09:05,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:09:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:09:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 20:09:05,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:09:05,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610675579] [2021-08-25 20:09:05,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610675579] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:05,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146744816] [2021-08-25 20:09:05,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 20:09:05,095 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:09:05,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:09:05,096 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-08-25 20:09:05,098 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-08-25 20:09:05,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-25 20:09:05,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:09:05,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-25 20:09:05,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:09:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 20:09:05,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146744816] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:05,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:09:05,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2021-08-25 20:09:05,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336489020] [2021-08-25 20:09:05,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-25 20:09:05,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:09:05,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-25 20:09:05,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:09:05,808 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:09:06,046 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-08-25 20:09:06,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-25 20:09:06,047 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-25 20:09:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:09:06,048 INFO L225 Difference]: With dead ends: 33 [2021-08-25 20:09:06,048 INFO L226 Difference]: Without dead ends: 24 [2021-08-25 20:09:06,048 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 218.3ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-08-25 20:09:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-08-25 20:09:06,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2021-08-25 20:09:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-08-25 20:09:06,052 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2021-08-25 20:09:06,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:09:06,052 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-08-25 20:09:06,053 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-08-25 20:09:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-25 20:09:06,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:06,053 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:06,074 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-08-25 20:09:06,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:09:06,254 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:06,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:06,255 INFO L82 PathProgramCache]: Analyzing trace with hash 258175967, now seen corresponding path program 4 times [2021-08-25 20:09:06,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:09:06,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528733693] [2021-08-25 20:09:06,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:09:06,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:09:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:09:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:09:06,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:09:06,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528733693] [2021-08-25 20:09:06,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528733693] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:06,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264493864] [2021-08-25 20:09:06,359 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-25 20:09:06,359 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:09:06,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:09:06,360 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-08-25 20:09:06,366 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-08-25 20:09:06,440 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-25 20:09:06,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:09:06,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-25 20:09:06,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:09:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:09:06,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264493864] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:06,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:09:06,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-08-25 20:09:06,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119699001] [2021-08-25 20:09:06,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 20:09:06,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:09:06,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 20:09:06,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-25 20:09:06,543 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:09:06,583 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2021-08-25 20:09:06,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-25 20:09:06,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-25 20:09:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:09:06,584 INFO L225 Difference]: With dead ends: 34 [2021-08-25 20:09:06,584 INFO L226 Difference]: Without dead ends: 26 [2021-08-25 20:09:06,584 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 39.1ms TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-25 20:09:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-08-25 20:09:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-08-25 20:09:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-08-25 20:09:06,588 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2021-08-25 20:09:06,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:09:06,589 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-08-25 20:09:06,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-08-25 20:09:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 20:09:06,590 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:06,590 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:06,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-25 20:09:06,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:09:06,813 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:06,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1661453471, now seen corresponding path program 5 times [2021-08-25 20:09:06,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:09:06,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805718596] [2021-08-25 20:09:06,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:09:06,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:09:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:09:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:09:06,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:09:06,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805718596] [2021-08-25 20:09:06,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805718596] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:06,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064776018] [2021-08-25 20:09:06,914 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-25 20:09:06,914 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:09:06,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:09:06,915 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-08-25 20:09:06,916 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-08-25 20:09:07,030 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-08-25 20:09:07,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:09:07,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-25 20:09:07,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:09:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:09:07,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064776018] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:07,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:09:07,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-08-25 20:09:07,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533966142] [2021-08-25 20:09:07,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-25 20:09:07,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:09:07,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-25 20:09:07,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-25 20:09:07,116 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:09:07,154 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2021-08-25 20:09:07,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 20:09:07,154 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-25 20:09:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:09:07,155 INFO L225 Difference]: With dead ends: 36 [2021-08-25 20:09:07,155 INFO L226 Difference]: Without dead ends: 28 [2021-08-25 20:09:07,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 43.2ms TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-08-25 20:09:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-08-25 20:09:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-08-25 20:09:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-08-25 20:09:07,159 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2021-08-25 20:09:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:09:07,159 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-08-25 20:09:07,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:09:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-08-25 20:09:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-25 20:09:07,160 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:07,160 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:07,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-25 20:09:07,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:09:07,386 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:07,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:07,386 INFO L82 PathProgramCache]: Analyzing trace with hash 410593891, now seen corresponding path program 6 times [2021-08-25 20:09:07,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:09:07,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308874984] [2021-08-25 20:09:07,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:09:07,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:09:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:09:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:09:07,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:09:07,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308874984] [2021-08-25 20:09:07,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308874984] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:09:07,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106301870] [2021-08-25 20:09:07,492 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-25 20:09:07,492 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:09:07,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:09:07,493 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-08-25 20:09:07,494 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-08-25 20:09:07,639 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-08-25 20:09:07,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:09:07,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-25 20:09:07,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:10:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-08-25 20:10:44,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106301870] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:10:44,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:10:44,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 14 [2021-08-25 20:10:44,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931823099] [2021-08-25 20:10:44,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-25 20:10:44,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:44,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-25 20:10:44,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=117, Unknown=1, NotChecked=0, Total=182 [2021-08-25 20:10:44,646 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:12,190 WARN L224 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-08-25 20:11:12,192 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 101 [2021-08-25 20:11:12,196 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-08-25 20:11:12,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:11:12,392 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:310) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:154) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:128) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:662) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:281) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:93) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:162) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:201) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:881) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:778) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) 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:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) 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) Caused by: java.io.IOException: Broken pipe at java.base/java.io.FileOutputStream.writeBytes(Native Method) at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:152) ... 35 more [2021-08-25 20:11:12,395 INFO L168 Benchmark]: Toolchain (without parser) took 129872.30 ms. Allocated memory was 58.7 MB in the beginning and 111.1 MB in the end (delta: 52.4 MB). Free memory was 37.9 MB in the beginning and 86.3 MB in the end (delta: -48.4 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:12,395 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 58.7 MB. Free memory was 41.1 MB in the beginning and 41.1 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:11:12,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.42 ms. Allocated memory is still 58.7 MB. Free memory was 37.7 MB in the beginning and 42.5 MB in the end (delta: -4.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:12,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.99 ms. Allocated memory is still 58.7 MB. Free memory was 42.3 MB in the beginning and 41.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:11:12,396 INFO L168 Benchmark]: Boogie Preprocessor took 18.87 ms. Allocated memory is still 58.7 MB. Free memory was 41.0 MB in the beginning and 39.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:11:12,396 INFO L168 Benchmark]: RCFGBuilder took 300.30 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 39.8 MB in the beginning and 58.6 MB in the end (delta: -18.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:12,396 INFO L168 Benchmark]: TraceAbstraction took 129261.42 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 57.9 MB in the beginning and 86.3 MB in the end (delta: -28.3 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:12,397 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.19 ms. Allocated memory is still 58.7 MB. Free memory was 41.1 MB in the beginning and 41.1 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 255.42 ms. Allocated memory is still 58.7 MB. Free memory was 37.7 MB in the beginning and 42.5 MB in the end (delta: -4.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 28.99 ms. Allocated memory is still 58.7 MB. Free memory was 42.3 MB in the beginning and 41.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 18.87 ms. Allocated memory is still 58.7 MB. Free memory was 41.0 MB in the beginning and 39.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 300.30 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 39.8 MB in the beginning and 58.6 MB in the end (delta: -18.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 129261.42 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 57.9 MB in the beginning and 86.3 MB in the end (delta: -28.3 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:310) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:11:14,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:11:14,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:11:14,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:11:14,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:11:14,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:11:14,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:11:14,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:11:14,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:11:14,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:11:14,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:11:14,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:11:14,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:11:14,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:11:14,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:11:14,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:11:14,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:11:14,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:11:14,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:11:14,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:11:14,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:11:14,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:11:14,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:11:14,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:11:14,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:11:14,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:11:14,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:11:14,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:11:14,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:11:14,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:11:14,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:11:14,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:11:14,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:11:14,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:11:14,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:11:14,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:11:14,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:11:14,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:11:14,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:11:14,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:11:14,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:11:14,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-25 20:11:14,317 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:11:14,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:11:14,319 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:11:14,319 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:11:14,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:11:14,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:11:14,321 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:11:14,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:11:14,322 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:11:14,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:11:14,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:11:14,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:11:14,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:11:14,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:11:14,323 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 20:11:14,324 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 20:11:14,324 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:11:14,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:11:14,324 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:11:14,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:11:14,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:11:14,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:11:14,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:11:14,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:11:14,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:11:14,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:11:14,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:11:14,326 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 20:11:14,326 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 20:11:14,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:11:14,326 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:11:14,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 20:11:14,327 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 -> 58eecb02814a6b78cadd872f0ade36a8b32c0833 [2021-08-25 20:11:14,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:11:14,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:11:14,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:11:14,655 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:11:14,656 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:11:14,657 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2021-08-25 20:11:14,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19f27a59/d9aaccf2a7f643fa9180ac9582b835f8/FLAG8cf41716e [2021-08-25 20:11:15,140 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:11:15,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2021-08-25 20:11:15,147 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19f27a59/d9aaccf2a7f643fa9180ac9582b835f8/FLAG8cf41716e [2021-08-25 20:11:15,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19f27a59/d9aaccf2a7f643fa9180ac9582b835f8 [2021-08-25 20:11:15,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:11:15,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:11:15,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:11:15,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:11:15,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:11:15,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:11:15" (1/1) ... [2021-08-25 20:11:15,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4bc9d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15, skipping insertion in model container [2021-08-25 20:11:15,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:11:15" (1/1) ... [2021-08-25 20:11:15,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:11:15,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:11:15,745 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2021-08-25 20:11:15,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:11:15,775 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:11:15,797 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2021-08-25 20:11:15,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:11:15,845 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:11:15,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15 WrapperNode [2021-08-25 20:11:15,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:11:15,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:11:15,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:11:15,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:11:15,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15" (1/1) ... [2021-08-25 20:11:15,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15" (1/1) ... [2021-08-25 20:11:15,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:11:15,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:11:15,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:11:15,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:11:15,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15" (1/1) ... [2021-08-25 20:11:15,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15" (1/1) ... [2021-08-25 20:11:15,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15" (1/1) ... [2021-08-25 20:11:15,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15" (1/1) ... [2021-08-25 20:11:15,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15" (1/1) ... [2021-08-25 20:11:15,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15" (1/1) ... [2021-08-25 20:11:15,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15" (1/1) ... [2021-08-25 20:11:15,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:11:15,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:11:15,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:11:15,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:11:15,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15" (1/1) ... [2021-08-25 20:11:15,936 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:11:15,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:11:15,958 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-08-25 20:11:15,988 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-08-25 20:11:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-25 20:11:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:11:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:11:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:11:16,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:11:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-25 20:11:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-25 20:11:16,345 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:11:16,346 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-25 20:11:16,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:11:16 BoogieIcfgContainer [2021-08-25 20:11:16,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:11:16,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:11:16,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:11:16,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:11:16,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:11:15" (1/3) ... [2021-08-25 20:11:16,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c077244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:11:16, skipping insertion in model container [2021-08-25 20:11:16,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:15" (2/3) ... [2021-08-25 20:11:16,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c077244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:11:16, skipping insertion in model container [2021-08-25 20:11:16,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:11:16" (3/3) ... [2021-08-25 20:11:16,367 INFO L111 eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2021-08-25 20:11:16,371 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:11:16,371 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:11:16,449 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:11:16,454 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, mConcurrency=FINITE_AUTOMATA, 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-08-25 20:11:16,460 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:11:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-25 20:11:16,479 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:16,480 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:16,481 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:11:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:16,489 INFO L82 PathProgramCache]: Analyzing trace with hash 212076531, now seen corresponding path program 1 times [2021-08-25 20:11:16,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:11:16,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099115407] [2021-08-25 20:11:16,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:16,502 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:11:16,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:11:16,506 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-08-25 20:11:16,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 20:11:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:16,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:11:16,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:11:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:16,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:11:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:16,774 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:11:16,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099115407] [2021-08-25 20:11:16,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099115407] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:16,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:16,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:11:16,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656119291] [2021-08-25 20:11:16,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:16,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:11:16,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:16,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:16,802 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:16,849 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2021-08-25 20:11:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:16,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-08-25 20:11:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:16,857 INFO L225 Difference]: With dead ends: 45 [2021-08-25 20:11:16,857 INFO L226 Difference]: Without dead ends: 23 [2021-08-25 20:11:16,859 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-08-25 20:11:16,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2021-08-25 20:11:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-08-25 20:11:16,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2021-08-25 20:11:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:16,884 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-25 20:11:16,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-08-25 20:11:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-25 20:11:16,885 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:16,885 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:16,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-25 20:11:17,094 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-08-25 20:11:17,094 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:11:17,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:17,095 INFO L82 PathProgramCache]: Analyzing trace with hash 780776823, now seen corresponding path program 1 times [2021-08-25 20:11:17,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:11:17,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105296937] [2021-08-25 20:11:17,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:17,096 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:11:17,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:11:17,098 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-08-25 20:11:17,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 20:11:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:17,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:11:17,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:11:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:17,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:11:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:17,307 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:11:17,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105296937] [2021-08-25 20:11:17,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105296937] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:11:17,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:11:17,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-25 20:11:17,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633669357] [2021-08-25 20:11:17,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-25 20:11:17,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:11:17,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-25 20:11:17,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:11:17,311 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:17,445 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-08-25 20:11:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 20:11:17,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-25 20:11:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:17,446 INFO L225 Difference]: With dead ends: 37 [2021-08-25 20:11:17,446 INFO L226 Difference]: Without dead ends: 31 [2021-08-25 20:11:17,447 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 97.9ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-08-25 20:11:17,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-08-25 20:11:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2021-08-25 20:11:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-08-25 20:11:17,452 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2021-08-25 20:11:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:17,452 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-08-25 20:11:17,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-08-25 20:11:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-25 20:11:17,453 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:17,453 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:17,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:11:17,662 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-08-25 20:11:17,663 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:11:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2109281665, now seen corresponding path program 2 times [2021-08-25 20:11:17,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:11:17,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77312206] [2021-08-25 20:11:17,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 20:11:17,664 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:11:17,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:11:17,667 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-08-25 20:11:17,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 20:11:17,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-25 20:11:17,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:11:17,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:11:17,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:11:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-25 20:11:17,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:11:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-25 20:11:17,932 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:11:17,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77312206] [2021-08-25 20:11:17,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77312206] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:17,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:17,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:11:17,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735363722] [2021-08-25 20:11:17,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:11:17,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:11:17,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:11:17,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:11:17,935 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:18,007 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2021-08-25 20:11:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:11:18,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-25 20:11:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:18,009 INFO L225 Difference]: With dead ends: 29 [2021-08-25 20:11:18,009 INFO L226 Difference]: Without dead ends: 23 [2021-08-25 20:11:18,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.7ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:11:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-08-25 20:11:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-08-25 20:11:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-08-25 20:11:18,019 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2021-08-25 20:11:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:18,020 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-08-25 20:11:18,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-08-25 20:11:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-25 20:11:18,022 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:18,022 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:18,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-25 20:11:18,234 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-08-25 20:11:18,235 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:11:18,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash 258175967, now seen corresponding path program 1 times [2021-08-25 20:11:18,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:11:18,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635998413] [2021-08-25 20:11:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:18,236 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:11:18,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:11:18,241 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-08-25 20:11:18,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-25 20:11:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:18,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-25 20:11:18,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:11:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:11:18,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:11:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:11:18,708 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:11:18,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635998413] [2021-08-25 20:11:18,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635998413] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:11:18,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:11:18,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-08-25 20:11:18,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292525690] [2021-08-25 20:11:18,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-25 20:11:18,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:11:18,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-25 20:11:18,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-08-25 20:11:18,710 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:18,968 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-08-25 20:11:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-25 20:11:18,969 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-25 20:11:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:18,969 INFO L225 Difference]: With dead ends: 41 [2021-08-25 20:11:18,969 INFO L226 Difference]: Without dead ends: 33 [2021-08-25 20:11:18,970 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 299.7ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-08-25 20:11:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-08-25 20:11:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-08-25 20:11:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-08-25 20:11:18,974 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 22 [2021-08-25 20:11:18,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:18,974 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-08-25 20:11:18,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-08-25 20:11:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 20:11:18,976 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:18,976 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:18,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:11:19,184 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-08-25 20:11:19,185 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:11:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:19,185 INFO L82 PathProgramCache]: Analyzing trace with hash -777640855, now seen corresponding path program 2 times [2021-08-25 20:11:19,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:11:19,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701068079] [2021-08-25 20:11:19,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 20:11:19,186 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:11:19,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:11:19,187 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-08-25 20:11:19,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-25 20:11:19,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 20:11:19,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:11:19,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-25 20:11:19,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:11:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-08-25 20:11:19,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:11:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-08-25 20:11:20,182 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:11:20,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701068079] [2021-08-25 20:11:20,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701068079] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:11:20,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:11:20,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-25 20:11:20,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512832538] [2021-08-25 20:11:20,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 20:11:20,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:11:20,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 20:11:20,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-25 20:11:20,185 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:21,738 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2021-08-25 20:11:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-25 20:11:21,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-25 20:11:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:21,743 INFO L225 Difference]: With dead ends: 47 [2021-08-25 20:11:21,743 INFO L226 Difference]: Without dead ends: 37 [2021-08-25 20:11:21,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 876.0ms TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2021-08-25 20:11:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-08-25 20:11:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-08-25 20:11:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-08-25 20:11:21,750 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2021-08-25 20:11:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:21,750 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-08-25 20:11:21,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-08-25 20:11:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 20:11:21,751 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:21,752 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:21,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-25 20:11:21,957 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-08-25 20:11:21,957 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:11:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:21,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2139052585, now seen corresponding path program 3 times [2021-08-25 20:11:21,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:11:21,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302478695] [2021-08-25 20:11:21,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 20:11:21,959 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:11:21,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:11:21,962 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-08-25 20:11:21,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-25 20:11:22,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-25 20:11:22,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:11:22,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-25 20:11:22,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:11:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-08-25 20:11:41,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:11:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-08-25 20:11:57,292 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:11:57,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302478695] [2021-08-25 20:11:57,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302478695] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:11:57,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:11:57,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-08-25 20:11:57,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827224196] [2021-08-25 20:11:57,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-25 20:11:57,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:11:57,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-25 20:11:57,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=211, Unknown=8, NotChecked=0, Total=306 [2021-08-25 20:11:57,294 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:12:31,604 WARN L207 SmtUtils]: Spent 9.14 s on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2021-08-25 20:13:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:01,296 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2021-08-25 20:13:01,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-25 20:13:01,296 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-08-25 20:13:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:01,297 INFO L225 Difference]: With dead ends: 48 [2021-08-25 20:13:01,297 INFO L226 Difference]: Without dead ends: 40 [2021-08-25 20:13:01,298 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 81327.0ms TimeCoverageRelationStatistics Valid=196, Invalid=496, Unknown=10, NotChecked=0, Total=702 [2021-08-25 20:13:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-25 20:13:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-08-25 20:13:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-08-25 20:13:01,306 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2021-08-25 20:13:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:01,306 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-08-25 20:13:01,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-08-25 20:13:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-25 20:13:01,307 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:01,307 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:01,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:01,508 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-08-25 20:13:01,508 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:01,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:01,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1739516288, now seen corresponding path program 4 times [2021-08-25 20:13:01,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:13:01,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751386026] [2021-08-25 20:13:01,509 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-25 20:13:01,509 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:13:01,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:13:01,510 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-08-25 20:13:01,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-25 20:13:01,717 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-25 20:13:01,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:13:01,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-25 20:13:01,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:39,091 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~c~0_49 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_48 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse3 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse0 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse5 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_49)) (.cse1 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46)) (.cse4 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse7 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse8 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_48)) (.cse6 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse2 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44))) (and (bvsle (_ bv48 32) .cse0) (bvsle .cse0 (_ bv57 32)) (bvsle .cse1 (_ bv57 32)) (bvsle (_ bv48 32) .cse2) (bvsle (_ bv48 32) .cse1) (bvsle (_ bv48 32) .cse3) (bvsle (_ bv48 32) .cse4) (bvsle (_ bv48 32) .cse5) (bvsle .cse6 (_ bv57 32)) (bvsle .cse3 (_ bv57 32)) (bvsle (_ bv48 32) .cse7) (= (bvadd (bvmul (_ bv10 32) .cse8) (bvmul (_ bv100000000 32) .cse3) (bvmul (_ bv1000000 32) .cse0) (bvmul (_ bv100000 32) .cse2) (bvmul (_ bv10000 32) .cse6) (bvmul (_ bv10000000 32) .cse7) .cse5 (bvmul (_ bv1000 32) .cse1) (bvmul (_ bv100 32) .cse4)) (bvadd c_ULTIMATE.start_main_~i~0 (_ bv1038366032 32))) (bvsle .cse7 (_ bv57 32)) (bvsle (_ bv48 32) .cse8) (bvsle (_ bv48 32) .cse6) (bvsle .cse2 (_ bv57 32))))) is different from true [2021-08-25 20:13:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 9 not checked. [2021-08-25 20:13:43,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:14:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-08-25 20:14:37,991 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:14:37,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751386026] [2021-08-25 20:14:37,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751386026] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:14:37,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:14:37,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2021-08-25 20:14:37,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972174975] [2021-08-25 20:14:37,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-25 20:14:37,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:14:37,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-25 20:14:37,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=370, Unknown=14, NotChecked=42, Total=552 [2021-08-25 20:14:37,994 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:15:33,873 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8))) (let ((.cse0 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse1 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42))) (and (bvsle (_ bv48 32) .cse0) (bvsle .cse0 (_ bv57 32)) (bvsle (_ bv48 32) .cse1) (= (bvadd c_ULTIMATE.start_main_~i~0 (_ bv528 32)) (bvadd (bvmul (_ bv10 32) .cse0) .cse1)) (bvsle .cse1 (_ bv57 32))))) (exists ((v_ULTIMATE.start_main_~c~0_49 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_48 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse5 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse2 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse7 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_49)) (.cse3 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46)) (.cse6 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse9 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse10 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_48)) (.cse8 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse4 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44))) (and (bvsle (_ bv48 32) .cse2) (bvsle .cse2 (_ bv57 32)) (bvsle .cse3 (_ bv57 32)) (bvsle (_ bv48 32) .cse4) (bvsle (_ bv48 32) .cse3) (bvsle (_ bv48 32) .cse5) (bvsle (_ bv48 32) .cse6) (bvsle (_ bv48 32) .cse7) (bvsle .cse8 (_ bv57 32)) (bvsle .cse5 (_ bv57 32)) (bvsle (_ bv48 32) .cse9) (= (bvadd (bvmul (_ bv10 32) .cse10) (bvmul (_ bv100000000 32) .cse5) (bvmul (_ bv1000000 32) .cse2) (bvmul (_ bv100000 32) .cse4) (bvmul (_ bv10000 32) .cse8) (bvmul (_ bv10000000 32) .cse9) .cse7 (bvmul (_ bv1000 32) .cse3) (bvmul (_ bv100 32) .cse6)) (bvadd c_ULTIMATE.start_main_~i~0 (_ bv1038366032 32))) (bvsle .cse9 (_ bv57 32)) (bvsle (_ bv48 32) .cse10) (bvsle (_ bv48 32) .cse8) (bvsle .cse4 (_ bv57 32)))))) is different from true [2021-08-25 20:15:36,260 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse0 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse1 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse2 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42))) (and (bvsle (_ bv48 32) .cse0) (bvsle .cse0 (_ bv57 32)) (bvsle (_ bv48 32) .cse1) (= (bvadd (bvmul (_ bv100 32) .cse1) (bvmul (_ bv10 32) .cse2) .cse0) (bvadd (_ bv5328 32) c_ULTIMATE.start_main_~i~0)) (bvsle .cse1 (_ bv57 32)) (bvsle (_ bv48 32) .cse2) (bvsle .cse2 (_ bv57 32))))) (exists ((v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_48 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse3 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse4 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46)) (.cse7 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse6 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse9 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse10 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_48)) (.cse8 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse5 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44))) (and (bvsle (_ bv48 32) .cse3) (bvsle .cse3 (_ bv57 32)) (bvsle .cse4 (_ bv57 32)) (bvsle (_ bv48 32) .cse5) (bvsle (_ bv48 32) .cse4) (bvsle (_ bv48 32) .cse6) (bvsle (_ bv48 32) .cse7) (bvsle .cse8 (_ bv57 32)) (bvsle .cse6 (_ bv57 32)) (bvsle (_ bv48 32) .cse9) (= (bvadd (bvmul (_ bv1000 32) .cse8) (bvmul (_ bv100000 32) .cse3) (bvmul (_ bv1000000 32) .cse9) (bvmul (_ bv100 32) .cse4) .cse10 (bvmul (_ bv10000 32) .cse5) (bvmul (_ bv10 32) .cse7) (bvmul (_ bv10000000 32) .cse6)) (bvadd c_ULTIMATE.start_main_~i~0 (_ bv533333328 32))) (bvsle .cse9 (_ bv57 32)) (bvsle (_ bv48 32) .cse10) (bvsle (_ bv48 32) .cse8) (bvsle .cse5 (_ bv57 32))))) (exists ((v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse13 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44)) (.cse15 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse11 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse14 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse16 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse17 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse12 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46))) (and (bvsle (_ bv48 32) .cse11) (bvsle .cse11 (_ bv57 32)) (bvsle .cse12 (_ bv57 32)) (bvsle (_ bv48 32) .cse13) (bvsle (_ bv48 32) .cse12) (bvsle (_ bv48 32) .cse14) (bvsle (_ bv48 32) .cse15) (bvsle .cse16 (_ bv57 32)) (bvsle .cse14 (_ bv57 32)) (bvsle (_ bv48 32) .cse17) (bvsle .cse17 (_ bv57 32)) (bvsle (_ bv48 32) .cse16) (bvsle .cse13 (_ bv57 32)) (= (bvadd (_ bv53333328 32) c_ULTIMATE.start_main_~i~0) (bvadd (bvmul (_ bv1000 32) .cse13) .cse15 (bvmul (_ bv10000 32) .cse11) (bvmul (_ bv1000000 32) .cse14) (bvmul (_ bv100 32) .cse16) (bvmul (_ bv100000 32) .cse17) (bvmul (_ bv10 32) .cse12)))))) (exists ((v_ULTIMATE.start_main_~c~0_49 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_48 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse18 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse23 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_49)) (.cse19 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46)) (.cse22 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse25 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse26 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_48)) (.cse24 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse20 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44))) (and (bvsle (_ bv48 32) .cse18) (bvsle .cse18 (_ bv57 32)) (bvsle .cse19 (_ bv57 32)) (bvsle (_ bv48 32) .cse20) (bvsle (_ bv48 32) .cse19) (bvsle (_ bv48 32) .cse21) (bvsle (_ bv48 32) .cse22) (bvsle (_ bv48 32) .cse23) (bvsle .cse24 (_ bv57 32)) (bvsle .cse21 (_ bv57 32)) (bvsle (_ bv48 32) .cse25) (= (bvadd (bvmul (_ bv10 32) .cse26) (bvmul (_ bv100000000 32) .cse21) (bvmul (_ bv1000000 32) .cse18) (bvmul (_ bv100000 32) .cse20) (bvmul (_ bv10000 32) .cse24) (bvmul (_ bv10000000 32) .cse25) .cse23 (bvmul (_ bv1000 32) .cse19) (bvmul (_ bv100 32) .cse22)) (bvadd c_ULTIMATE.start_main_~i~0 (_ bv1038366032 32))) (bvsle .cse25 (_ bv57 32)) (bvsle (_ bv48 32) .cse26) (bvsle (_ bv48 32) .cse24) (bvsle .cse20 (_ bv57 32)))))) is different from true [2021-08-25 20:15:38,853 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_48 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse0 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse1 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46)) (.cse4 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse3 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse6 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse7 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_48)) (.cse5 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse2 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44))) (and (bvsle (_ bv48 32) .cse0) (bvsle .cse0 (_ bv57 32)) (bvsle .cse1 (_ bv57 32)) (bvsle (_ bv48 32) .cse2) (bvsle (_ bv48 32) .cse1) (bvsle (_ bv48 32) .cse3) (bvsle (_ bv48 32) .cse4) (bvsle .cse5 (_ bv57 32)) (bvsle .cse3 (_ bv57 32)) (bvsle (_ bv48 32) .cse6) (= (bvadd (bvmul (_ bv1000 32) .cse5) (bvmul (_ bv100000 32) .cse0) (bvmul (_ bv1000000 32) .cse6) (bvmul (_ bv100 32) .cse1) .cse7 (bvmul (_ bv10000 32) .cse2) (bvmul (_ bv10 32) .cse4) (bvmul (_ bv10000000 32) .cse3)) (bvadd c_ULTIMATE.start_main_~i~0 (_ bv533333328 32))) (bvsle .cse6 (_ bv57 32)) (bvsle (_ bv48 32) .cse7) (bvsle (_ bv48 32) .cse5) (bvsle .cse2 (_ bv57 32))))) (exists ((v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse8 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse10 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse11 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse9 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44))) (and (bvsle (_ bv48 32) .cse8) (bvsle .cse8 (_ bv57 32)) (bvsle (_ bv48 32) .cse9) (bvsle (_ bv48 32) .cse10) (bvsle .cse10 (_ bv57 32)) (bvsle (_ bv48 32) .cse11) (= (bvadd (bvmul (_ bv10 32) .cse8) .cse9 (bvmul (_ bv1000 32) .cse10) (bvmul (_ bv100 32) .cse11)) (bvadd (_ bv53328 32) c_ULTIMATE.start_main_~i~0)) (bvsle .cse11 (_ bv57 32)) (bvsle .cse9 (_ bv57 32))))) (exists ((v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse14 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44)) (.cse16 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse12 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse15 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse17 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse18 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse13 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46))) (and (bvsle (_ bv48 32) .cse12) (bvsle .cse12 (_ bv57 32)) (bvsle .cse13 (_ bv57 32)) (bvsle (_ bv48 32) .cse14) (bvsle (_ bv48 32) .cse13) (bvsle (_ bv48 32) .cse15) (bvsle (_ bv48 32) .cse16) (bvsle .cse17 (_ bv57 32)) (bvsle .cse15 (_ bv57 32)) (bvsle (_ bv48 32) .cse18) (bvsle .cse18 (_ bv57 32)) (bvsle (_ bv48 32) .cse17) (bvsle .cse14 (_ bv57 32)) (= (bvadd (_ bv53333328 32) c_ULTIMATE.start_main_~i~0) (bvadd (bvmul (_ bv1000 32) .cse14) .cse16 (bvmul (_ bv10000 32) .cse12) (bvmul (_ bv1000000 32) .cse15) (bvmul (_ bv100 32) .cse17) (bvmul (_ bv100000 32) .cse18) (bvmul (_ bv10 32) .cse13)))))) (exists ((v_ULTIMATE.start_main_~c~0_49 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_48 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse19 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse24 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_49)) (.cse20 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46)) (.cse23 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse26 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse27 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_48)) (.cse25 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse21 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44))) (and (bvsle (_ bv48 32) .cse19) (bvsle .cse19 (_ bv57 32)) (bvsle .cse20 (_ bv57 32)) (bvsle (_ bv48 32) .cse21) (bvsle (_ bv48 32) .cse20) (bvsle (_ bv48 32) .cse22) (bvsle (_ bv48 32) .cse23) (bvsle (_ bv48 32) .cse24) (bvsle .cse25 (_ bv57 32)) (bvsle .cse22 (_ bv57 32)) (bvsle (_ bv48 32) .cse26) (= (bvadd (bvmul (_ bv10 32) .cse27) (bvmul (_ bv100000000 32) .cse22) (bvmul (_ bv1000000 32) .cse19) (bvmul (_ bv100000 32) .cse21) (bvmul (_ bv10000 32) .cse25) (bvmul (_ bv10000000 32) .cse26) .cse24 (bvmul (_ bv1000 32) .cse20) (bvmul (_ bv100 32) .cse23)) (bvadd c_ULTIMATE.start_main_~i~0 (_ bv1038366032 32))) (bvsle .cse26 (_ bv57 32)) (bvsle (_ bv48 32) .cse27) (bvsle (_ bv48 32) .cse25) (bvsle .cse21 (_ bv57 32)))))) is different from true [2021-08-25 20:16:17,997 WARN L207 SmtUtils]: Spent 16.98 s on a formula simplification that was a NOOP. DAG size: 105 [2021-08-25 20:16:58,937 WARN L207 SmtUtils]: Spent 15.65 s on a formula simplification that was a NOOP. DAG size: 95 [2021-08-25 20:17:04,178 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_48 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse0 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse1 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46)) (.cse4 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse3 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse6 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse7 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_48)) (.cse5 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse2 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44))) (and (bvsle (_ bv48 32) .cse0) (bvsle .cse0 (_ bv57 32)) (bvsle .cse1 (_ bv57 32)) (bvsle (_ bv48 32) .cse2) (bvsle (_ bv48 32) .cse1) (bvsle (_ bv48 32) .cse3) (bvsle (_ bv48 32) .cse4) (bvsle .cse5 (_ bv57 32)) (bvsle .cse3 (_ bv57 32)) (bvsle (_ bv48 32) .cse6) (= (bvadd (bvmul (_ bv1000 32) .cse5) (bvmul (_ bv100000 32) .cse0) (bvmul (_ bv1000000 32) .cse6) (bvmul (_ bv100 32) .cse1) .cse7 (bvmul (_ bv10000 32) .cse2) (bvmul (_ bv10 32) .cse4) (bvmul (_ bv10000000 32) .cse3)) (bvadd c_ULTIMATE.start_main_~i~0 (_ bv533333328 32))) (bvsle .cse6 (_ bv57 32)) (bvsle (_ bv48 32) .cse7) (bvsle (_ bv48 32) .cse5) (bvsle .cse2 (_ bv57 32))))) (exists ((v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44)) (.cse12 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse8 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse11 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse13 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse14 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse9 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46))) (and (bvsle (_ bv48 32) .cse8) (bvsle .cse8 (_ bv57 32)) (bvsle .cse9 (_ bv57 32)) (bvsle (_ bv48 32) .cse10) (bvsle (_ bv48 32) .cse9) (bvsle (_ bv48 32) .cse11) (bvsle (_ bv48 32) .cse12) (bvsle .cse13 (_ bv57 32)) (bvsle .cse11 (_ bv57 32)) (bvsle (_ bv48 32) .cse14) (bvsle .cse14 (_ bv57 32)) (bvsle (_ bv48 32) .cse13) (bvsle .cse10 (_ bv57 32)) (= (bvadd (_ bv53333328 32) c_ULTIMATE.start_main_~i~0) (bvadd (bvmul (_ bv1000 32) .cse10) .cse12 (bvmul (_ bv10000 32) .cse8) (bvmul (_ bv1000000 32) .cse11) (bvmul (_ bv100 32) .cse13) (bvmul (_ bv100000 32) .cse14) (bvmul (_ bv10 32) .cse9)))))) (exists ((v_ULTIMATE.start_main_~c~0_49 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_48 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse18 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse15 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse20 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_49)) (.cse16 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46)) (.cse19 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse22 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse23 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_48)) (.cse21 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse17 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44))) (and (bvsle (_ bv48 32) .cse15) (bvsle .cse15 (_ bv57 32)) (bvsle .cse16 (_ bv57 32)) (bvsle (_ bv48 32) .cse17) (bvsle (_ bv48 32) .cse16) (bvsle (_ bv48 32) .cse18) (bvsle (_ bv48 32) .cse19) (bvsle (_ bv48 32) .cse20) (bvsle .cse21 (_ bv57 32)) (bvsle .cse18 (_ bv57 32)) (bvsle (_ bv48 32) .cse22) (= (bvadd (bvmul (_ bv10 32) .cse23) (bvmul (_ bv100000000 32) .cse18) (bvmul (_ bv1000000 32) .cse15) (bvmul (_ bv100000 32) .cse17) (bvmul (_ bv10000 32) .cse21) (bvmul (_ bv10000000 32) .cse22) .cse20 (bvmul (_ bv1000 32) .cse16) (bvmul (_ bv100 32) .cse19)) (bvadd c_ULTIMATE.start_main_~i~0 (_ bv1038366032 32))) (bvsle .cse22 (_ bv57 32)) (bvsle (_ bv48 32) .cse23) (bvsle (_ bv48 32) .cse21) (bvsle .cse17 (_ bv57 32)))))) is different from true [2021-08-25 20:17:06,971 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_48 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse0 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse1 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46)) (.cse4 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse3 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse6 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse7 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_48)) (.cse5 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse2 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44))) (and (bvsle (_ bv48 32) .cse0) (bvsle .cse0 (_ bv57 32)) (bvsle .cse1 (_ bv57 32)) (bvsle (_ bv48 32) .cse2) (bvsle (_ bv48 32) .cse1) (bvsle (_ bv48 32) .cse3) (bvsle (_ bv48 32) .cse4) (bvsle .cse5 (_ bv57 32)) (bvsle .cse3 (_ bv57 32)) (bvsle (_ bv48 32) .cse6) (= (bvadd (bvmul (_ bv1000 32) .cse5) (bvmul (_ bv100000 32) .cse0) (bvmul (_ bv1000000 32) .cse6) (bvmul (_ bv100 32) .cse1) .cse7 (bvmul (_ bv10000 32) .cse2) (bvmul (_ bv10 32) .cse4) (bvmul (_ bv10000000 32) .cse3)) (bvadd c_ULTIMATE.start_main_~i~0 (_ bv533333328 32))) (bvsle .cse6 (_ bv57 32)) (bvsle (_ bv48 32) .cse7) (bvsle (_ bv48 32) .cse5) (bvsle .cse2 (_ bv57 32))))) (exists ((v_ULTIMATE.start_main_~c~0_49 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_46 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_45 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_48 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_47 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_42 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_41 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_44 (_ BitVec 8)) (v_ULTIMATE.start_main_~c~0_43 (_ BitVec 8))) (let ((.cse11 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_41)) (.cse8 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_43)) (.cse13 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_49)) (.cse9 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_46)) (.cse12 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_47)) (.cse15 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_42)) (.cse16 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_48)) (.cse14 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_45)) (.cse10 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_44))) (and (bvsle (_ bv48 32) .cse8) (bvsle .cse8 (_ bv57 32)) (bvsle .cse9 (_ bv57 32)) (bvsle (_ bv48 32) .cse10) (bvsle (_ bv48 32) .cse9) (bvsle (_ bv48 32) .cse11) (bvsle (_ bv48 32) .cse12) (bvsle (_ bv48 32) .cse13) (bvsle .cse14 (_ bv57 32)) (bvsle .cse11 (_ bv57 32)) (bvsle (_ bv48 32) .cse15) (= (bvadd (bvmul (_ bv10 32) .cse16) (bvmul (_ bv100000000 32) .cse11) (bvmul (_ bv1000000 32) .cse8) (bvmul (_ bv100000 32) .cse10) (bvmul (_ bv10000 32) .cse14) (bvmul (_ bv10000000 32) .cse15) .cse13 (bvmul (_ bv1000 32) .cse9) (bvmul (_ bv100 32) .cse12)) (bvadd c_ULTIMATE.start_main_~i~0 (_ bv1038366032 32))) (bvsle .cse15 (_ bv57 32)) (bvsle (_ bv48 32) .cse16) (bvsle (_ bv48 32) .cse14) (bvsle .cse10 (_ bv57 32)))))) is different from true [2021-08-25 20:17:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:38,197 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2021-08-25 20:17:38,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-25 20:17:38,198 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-25 20:17:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:38,199 INFO L225 Difference]: With dead ends: 45 [2021-08-25 20:17:38,199 INFO L226 Difference]: Without dead ends: 41 [2021-08-25 20:17:38,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 222776.0ms TimeCoverageRelationStatistics Valid=236, Invalid=629, Unknown=29, NotChecked=366, Total=1260 [2021-08-25 20:17:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-08-25 20:17:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-08-25 20:17:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-08-25 20:17:38,212 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2021-08-25 20:17:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:38,212 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-08-25 20:17:38,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-08-25 20:17:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-25 20:17:38,214 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:38,214 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:38,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-25 20:17:38,426 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-08-25 20:17:38,426 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:38,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:38,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1907904535, now seen corresponding path program 5 times [2021-08-25 20:17:38,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:17:38,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851187051] [2021-08-25 20:17:38,427 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-25 20:17:38,428 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:17:38,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:17:38,428 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-08-25 20:17:38,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-25 20:17:38,883 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2021-08-25 20:17:38,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-25 20:17:38,884 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:17:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:17:39,145 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-25 20:17:39,145 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:17:39,146 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:17:39,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-25 20:17:39,348 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-08-25 20:17:39,353 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:17:39,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:17:39 BoogieIcfgContainer [2021-08-25 20:17:39,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:17:39,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:17:39,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:17:39,396 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:17:39,396 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:11:16" (3/4) ... [2021-08-25 20:17:39,397 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:17:39,462 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:17:39,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:17:39,468 INFO L168 Benchmark]: Toolchain (without parser) took 383888.03 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 32.8 MB in the beginning and 27.3 MB in the end (delta: 5.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:17:39,469 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 54.5 MB. Free memory was 36.1 MB in the beginning and 36.1 MB in the end (delta: 25.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:17:39,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.92 ms. Allocated memory is still 54.5 MB. Free memory was 32.6 MB in the beginning and 37.2 MB in the end (delta: -4.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:17:39,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.95 ms. Allocated memory is still 54.5 MB. Free memory was 37.2 MB in the beginning and 35.7 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:17:39,470 INFO L168 Benchmark]: Boogie Preprocessor took 44.25 ms. Allocated memory is still 54.5 MB. Free memory was 35.7 MB in the beginning and 34.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:17:39,470 INFO L168 Benchmark]: RCFGBuilder took 420.24 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 34.4 MB in the beginning and 46.5 MB in the end (delta: -12.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:17:39,470 INFO L168 Benchmark]: TraceAbstraction took 383045.87 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 46.0 MB in the beginning and 31.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:17:39,471 INFO L168 Benchmark]: Witness Printer took 67.94 ms. Allocated memory is still 81.8 MB. Free memory was 31.5 MB in the beginning and 27.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:17:39,473 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.21 ms. Allocated memory is still 54.5 MB. Free memory was 36.1 MB in the beginning and 36.1 MB in the end (delta: 25.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 268.92 ms. Allocated memory is still 54.5 MB. Free memory was 32.6 MB in the beginning and 37.2 MB in the end (delta: -4.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 34.95 ms. Allocated memory is still 54.5 MB. Free memory was 37.2 MB in the beginning and 35.7 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.25 ms. Allocated memory is still 54.5 MB. Free memory was 35.7 MB in the beginning and 34.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 420.24 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 34.4 MB in the beginning and 46.5 MB in the end (delta: -12.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 383045.87 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 46.0 MB in the beginning and 31.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. * Witness Printer took 67.94 ms. Allocated memory is still 81.8 MB. Free memory was 31.5 MB in the beginning and 27.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 9]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] char in[11]; [L17] char *s; [L18] unsigned char c; [L19] int i, j; [L20] int idx_in; [L21] i = 0 [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ [L21] COND FALSE !(i < 11) [L23] in[10] = 0 [L24] idx_in = 0 [L25] s = in [L26] i = 0 [L27] EXPR in[idx_in] [L27] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND FALSE !(('0' <= c) && (c <= '9')) [L8] COND TRUE !(cond) [L9] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 382904.8ms, OverallIterations: 8, TraceHistogramMax: 11, EmptinessCheckTime: 16.2ms, AutomataDifference: 246313.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 52 SDtfs, 139 SDslu, 192 SDs, 0 SdLazy, 343 SolverSat, 113 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 52896.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 305424.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=7, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 56.1ms AutomataMinimizationTime, 7 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 115.1ms SsaConstructionTime, 502.4ms SatisfiabilityAnalysisTime, 133212.0ms InterpolantComputationTime, 209 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 324 ConstructedInterpolants, 37 QuantifiedInterpolants, 2312 SizeOfPredicates, 45 NumberOfNonLiveVariables, 493 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 804/1022 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-25 20:17:39,585 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...