./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.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/s3_clnt_2.BV.c.cil-2a.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 6995ed6ba91d7bb4325b7b2cb6cc1ca7ba7d3a61 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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/s3_clnt_2.BV.c.cil-2a.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 6995ed6ba91d7bb4325b7b2cb6cc1ca7ba7d3a61 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:00:31,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:00:31,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:00:32,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:00:32,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:00:32,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:00:32,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:00:32,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:00:32,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:00:32,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:00:32,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:00:32,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:00:32,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:00:32,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:00:32,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:00:32,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:00:32,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:00:32,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:00:32,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:00:32,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:00:32,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:00:32,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:00:32,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:00:32,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:00:32,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:00:32,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:00:32,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:00:32,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:00:32,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:00:32,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:00:32,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:00:32,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:00:32,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:00:32,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:00:32,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:00:32,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:00:32,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:00:32,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:00:32,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:00:32,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:00:32,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:00:32,121 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:00:32,170 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:00:32,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:00:32,171 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:00:32,171 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:00:32,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:00:32,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:00:32,173 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:00:32,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:00:32,174 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:00:32,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:00:32,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:00:32,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:00:32,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:00:32,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:00:32,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:00:32,176 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:00:32,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:00:32,180 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:00:32,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:00:32,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:00:32,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:00:32,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:00:32,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:00:32,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:00:32,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:00:32,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:00:32,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:00:32,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:00:32,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:00:32,182 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:00:32,182 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 -> 6995ed6ba91d7bb4325b7b2cb6cc1ca7ba7d3a61 [2021-08-25 20:00:32,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:00:32,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:00:32,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:00:32,764 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:00:32,764 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:00:32,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2021-08-25 20:00:32,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e531afb/ab75a965078e4f839e0bc5c7363f1c6f/FLAGa7a190c05 [2021-08-25 20:00:33,573 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:00:33,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2021-08-25 20:00:33,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e531afb/ab75a965078e4f839e0bc5c7363f1c6f/FLAGa7a190c05 [2021-08-25 20:00:33,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e531afb/ab75a965078e4f839e0bc5c7363f1c6f [2021-08-25 20:00:33,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:00:33,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:00:33,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:00:33,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:00:33,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:00:33,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:00:33" (1/1) ... [2021-08-25 20:00:33,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d7c794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:33, skipping insertion in model container [2021-08-25 20:00:33,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:00:33" (1/1) ... [2021-08-25 20:00:33,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:00:33,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:00:34,166 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/s3_clnt_2.BV.c.cil-2a.c[37184,37197] [2021-08-25 20:00:34,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:00:34,244 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:00:34,378 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/s3_clnt_2.BV.c.cil-2a.c[37184,37197] [2021-08-25 20:00:34,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:00:34,417 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:00:34,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:34 WrapperNode [2021-08-25 20:00:34,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:00:34,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:00:34,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:00:34,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:00:34,428 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:00:34" (1/1) ... [2021-08-25 20:00:34,466 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:00:34" (1/1) ... [2021-08-25 20:00:34,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:00:34,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:00:34,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:00:34,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:00:34,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:34" (1/1) ... [2021-08-25 20:00:34,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:34" (1/1) ... [2021-08-25 20:00:34,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:34" (1/1) ... [2021-08-25 20:00:34,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:34" (1/1) ... [2021-08-25 20:00:34,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:34" (1/1) ... [2021-08-25 20:00:34,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:34" (1/1) ... [2021-08-25 20:00:34,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:34" (1/1) ... [2021-08-25 20:00:34,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:00:34,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:00:34,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:00:34,602 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:00:34,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:34" (1/1) ... [2021-08-25 20:00:34,633 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:00:34,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:00:34,674 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:00:34,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:00:34,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:00:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:00:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:00:34,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:00:34,967 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:00:35,544 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 20:00:35,544 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 20:00:35,551 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:00:35,551 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:00:35,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:00:35 BoogieIcfgContainer [2021-08-25 20:00:35,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:00:35,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:00:35,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:00:35,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:00:35,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:00:33" (1/3) ... [2021-08-25 20:00:35,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ce519c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:00:35, skipping insertion in model container [2021-08-25 20:00:35,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:34" (2/3) ... [2021-08-25 20:00:35,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ce519c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:00:35, skipping insertion in model container [2021-08-25 20:00:35,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:00:35" (3/3) ... [2021-08-25 20:00:35,560 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2021-08-25 20:00:35,576 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:00:35,576 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:00:35,629 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:00:35,635 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:00:35,636 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:00:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 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:00:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 20:00:35,658 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:35,658 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:35,659 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:35,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:35,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2021-08-25 20:00:35,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:35,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179704843] [2021-08-25 20:00:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:35,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:35,946 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:00:35,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:35,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179704843] [2021-08-25 20:00:35,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179704843] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:35,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:35,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:35,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429482038] [2021-08-25 20:00:35,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:35,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:35,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:35,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:35,971 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 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 8.0) internal successors, (24), 3 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:00:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:36,227 INFO L93 Difference]: Finished difference Result 246 states and 421 transitions. [2021-08-25 20:00:36,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:36,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 24 [2021-08-25 20:00:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:36,250 INFO L225 Difference]: With dead ends: 246 [2021-08-25 20:00:36,251 INFO L226 Difference]: Without dead ends: 112 [2021-08-25 20:00:36,266 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-08-25 20:00:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-08-25 20:00:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 111 states have internal predecessors, (169), 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:00:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2021-08-25 20:00:36,317 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2021-08-25 20:00:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:36,318 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2021-08-25 20:00:36,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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:00:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2021-08-25 20:00:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 20:00:36,322 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:36,322 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:36,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:00:36,323 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:36,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2021-08-25 20:00:36,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:36,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068128498] [2021-08-25 20:00:36,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:36,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:00:36,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:36,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068128498] [2021-08-25 20:00:36,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068128498] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:36,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:36,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:36,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734781022] [2021-08-25 20:00:36,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:36,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:36,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:36,449 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:36,581 INFO L93 Difference]: Finished difference Result 233 states and 356 transitions. [2021-08-25 20:00:36,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:36,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-08-25 20:00:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:36,586 INFO L225 Difference]: With dead ends: 233 [2021-08-25 20:00:36,586 INFO L226 Difference]: Without dead ends: 131 [2021-08-25 20:00:36,587 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-25 20:00:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2021-08-25 20:00:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5) internal successors, (189), 126 states have internal predecessors, (189), 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:00:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2021-08-25 20:00:36,601 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2021-08-25 20:00:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:36,601 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2021-08-25 20:00:36,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2021-08-25 20:00:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-25 20:00:36,606 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:36,606 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:36,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:00:36,609 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:36,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:36,613 INFO L82 PathProgramCache]: Analyzing trace with hash 213639527, now seen corresponding path program 1 times [2021-08-25 20:00:36,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:36,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118109413] [2021-08-25 20:00:36,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:36,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:00:36,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:36,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118109413] [2021-08-25 20:00:36,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118109413] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:36,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:36,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:36,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180867922] [2021-08-25 20:00:36,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:36,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:36,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:36,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:36,698 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:00:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:36,826 INFO L93 Difference]: Finished difference Result 265 states and 400 transitions. [2021-08-25 20:00:36,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:36,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 50 [2021-08-25 20:00:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:36,828 INFO L225 Difference]: With dead ends: 265 [2021-08-25 20:00:36,828 INFO L226 Difference]: Without dead ends: 148 [2021-08-25 20:00:36,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-08-25 20:00:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2021-08-25 20:00:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 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:00:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2021-08-25 20:00:36,836 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2021-08-25 20:00:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:36,836 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2021-08-25 20:00:36,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:00:36,837 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2021-08-25 20:00:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-25 20:00:36,838 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:36,838 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:36,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:00:36,839 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:36,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:36,839 INFO L82 PathProgramCache]: Analyzing trace with hash 370823208, now seen corresponding path program 1 times [2021-08-25 20:00:36,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:36,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251208316] [2021-08-25 20:00:36,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:36,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 20:00:36,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:36,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251208316] [2021-08-25 20:00:36,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251208316] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:36,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:36,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:36,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583005369] [2021-08-25 20:00:36,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:36,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:36,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:36,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:36,924 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:37,104 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2021-08-25 20:00:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:37,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-08-25 20:00:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:37,122 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:00:37,122 INFO L226 Difference]: Without dead ends: 193 [2021-08-25 20:00:37,125 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-08-25 20:00:37,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2021-08-25 20:00:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4184782608695652) internal successors, (261), 184 states have internal predecessors, (261), 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:00:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2021-08-25 20:00:37,144 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 67 [2021-08-25 20:00:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:37,146 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2021-08-25 20:00:37,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2021-08-25 20:00:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-25 20:00:37,151 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:37,152 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:37,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:00:37,152 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:37,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:37,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1434615126, now seen corresponding path program 1 times [2021-08-25 20:00:37,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:37,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715621383] [2021-08-25 20:00:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:37,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 20:00:37,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:37,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715621383] [2021-08-25 20:00:37,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715621383] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:37,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:37,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:37,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421924894] [2021-08-25 20:00:37,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:37,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:37,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:37,280 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:37,385 INFO L93 Difference]: Finished difference Result 383 states and 548 transitions. [2021-08-25 20:00:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:37,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-08-25 20:00:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:37,387 INFO L225 Difference]: With dead ends: 383 [2021-08-25 20:00:37,387 INFO L226 Difference]: Without dead ends: 208 [2021-08-25 20:00:37,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-08-25 20:00:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2021-08-25 20:00:37,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.4039408866995073) internal successors, (285), 203 states have internal predecessors, (285), 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:00:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2021-08-25 20:00:37,407 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 67 [2021-08-25 20:00:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:37,409 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2021-08-25 20:00:37,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2021-08-25 20:00:37,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-25 20:00:37,411 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:37,412 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:37,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:00:37,412 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:37,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:37,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1023824768, now seen corresponding path program 1 times [2021-08-25 20:00:37,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:37,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760350067] [2021-08-25 20:00:37,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:37,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-08-25 20:00:37,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:37,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760350067] [2021-08-25 20:00:37,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760350067] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:37,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:37,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:37,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78030338] [2021-08-25 20:00:37,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:37,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:37,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:37,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:37,502 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:00:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:37,703 INFO L93 Difference]: Finished difference Result 422 states and 598 transitions. [2021-08-25 20:00:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:37,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 83 [2021-08-25 20:00:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:37,705 INFO L225 Difference]: With dead ends: 422 [2021-08-25 20:00:37,705 INFO L226 Difference]: Without dead ends: 228 [2021-08-25 20:00:37,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-08-25 20:00:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2021-08-25 20:00:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.3883928571428572) internal successors, (311), 224 states have internal predecessors, (311), 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:00:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2021-08-25 20:00:37,710 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 83 [2021-08-25 20:00:37,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:37,710 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2021-08-25 20:00:37,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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:00:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2021-08-25 20:00:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:00:37,711 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:37,711 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:37,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:00:37,711 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:37,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:37,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1619803512, now seen corresponding path program 1 times [2021-08-25 20:00:37,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:37,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875161579] [2021-08-25 20:00:37,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:37,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 20:00:37,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:37,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875161579] [2021-08-25 20:00:37,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875161579] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:37,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:37,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:37,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878065823] [2021-08-25 20:00:37,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:37,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:37,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:37,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:37,758 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:00:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:37,786 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions. [2021-08-25 20:00:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:37,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 103 [2021-08-25 20:00:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:37,789 INFO L225 Difference]: With dead ends: 652 [2021-08-25 20:00:37,789 INFO L226 Difference]: Without dead ends: 437 [2021-08-25 20:00:37,789 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-08-25 20:00:37,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2021-08-25 20:00:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.3761467889908257) internal successors, (600), 436 states have internal predecessors, (600), 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:00:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 600 transitions. [2021-08-25 20:00:37,800 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 600 transitions. Word has length 103 [2021-08-25 20:00:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:37,800 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 600 transitions. [2021-08-25 20:00:37,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:00:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 600 transitions. [2021-08-25 20:00:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:00:37,802 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:37,802 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:37,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:00:37,802 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:37,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:37,803 INFO L82 PathProgramCache]: Analyzing trace with hash -713589126, now seen corresponding path program 1 times [2021-08-25 20:00:37,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:37,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813731358] [2021-08-25 20:00:37,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:37,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-25 20:00:37,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:37,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813731358] [2021-08-25 20:00:37,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813731358] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:37,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:37,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:37,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799297576] [2021-08-25 20:00:37,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:37,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:37,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:37,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:37,839 INFO L87 Difference]: Start difference. First operand 437 states and 600 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:00:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:37,858 INFO L93 Difference]: Finished difference Result 885 states and 1214 transitions. [2021-08-25 20:00:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:37,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 103 [2021-08-25 20:00:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:37,860 INFO L225 Difference]: With dead ends: 885 [2021-08-25 20:00:37,861 INFO L226 Difference]: Without dead ends: 458 [2021-08-25 20:00:37,861 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-08-25 20:00:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2021-08-25 20:00:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.3719912472647702) internal successors, (627), 457 states have internal predecessors, (627), 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:00:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 627 transitions. [2021-08-25 20:00:37,871 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 627 transitions. Word has length 103 [2021-08-25 20:00:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:37,872 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 627 transitions. [2021-08-25 20:00:37,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:00:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 627 transitions. [2021-08-25 20:00:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-25 20:00:37,873 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:37,873 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:37,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:00:37,874 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:37,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:37,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1034569449, now seen corresponding path program 1 times [2021-08-25 20:00:37,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:37,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192495185] [2021-08-25 20:00:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:37,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-08-25 20:00:37,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:37,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192495185] [2021-08-25 20:00:37,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192495185] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:37,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:37,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:37,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350600176] [2021-08-25 20:00:37,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:37,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:37,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:37,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:37,907 INFO L87 Difference]: Start difference. First operand 458 states and 627 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:37,951 INFO L93 Difference]: Finished difference Result 932 states and 1274 transitions. [2021-08-25 20:00:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:37,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-08-25 20:00:37,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:37,964 INFO L225 Difference]: With dead ends: 932 [2021-08-25 20:00:37,964 INFO L226 Difference]: Without dead ends: 484 [2021-08-25 20:00:37,965 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-08-25 20:00:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2021-08-25 20:00:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.3664596273291925) internal successors, (660), 483 states have internal predecessors, (660), 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:00:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 660 transitions. [2021-08-25 20:00:38,003 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 660 transitions. Word has length 104 [2021-08-25 20:00:38,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:38,004 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 660 transitions. [2021-08-25 20:00:38,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 660 transitions. [2021-08-25 20:00:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:00:38,005 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:38,006 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:38,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:00:38,006 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:38,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:38,007 INFO L82 PathProgramCache]: Analyzing trace with hash -53319870, now seen corresponding path program 1 times [2021-08-25 20:00:38,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:38,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905721161] [2021-08-25 20:00:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:38,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-08-25 20:00:38,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:38,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905721161] [2021-08-25 20:00:38,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905721161] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:38,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:38,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:38,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592931945] [2021-08-25 20:00:38,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:38,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:38,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:38,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:38,094 INFO L87 Difference]: Start difference. First operand 484 states and 660 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:00:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:38,398 INFO L93 Difference]: Finished difference Result 699 states and 957 transitions. [2021-08-25 20:00:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:38,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 105 [2021-08-25 20:00:38,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:38,415 INFO L225 Difference]: With dead ends: 699 [2021-08-25 20:00:38,416 INFO L226 Difference]: Without dead ends: 697 [2021-08-25 20:00:38,416 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-08-25 20:00:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2021-08-25 20:00:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 696 states have (on average 1.3721264367816093) internal successors, (955), 696 states have internal predecessors, (955), 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:00:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 955 transitions. [2021-08-25 20:00:38,434 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 955 transitions. Word has length 105 [2021-08-25 20:00:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:38,434 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 955 transitions. [2021-08-25 20:00:38,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:00:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 955 transitions. [2021-08-25 20:00:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-08-25 20:00:38,436 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:38,440 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:38,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:00:38,441 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:38,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1519363111, now seen corresponding path program 1 times [2021-08-25 20:00:38,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:38,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414562546] [2021-08-25 20:00:38,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:38,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-08-25 20:00:38,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:38,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414562546] [2021-08-25 20:00:38,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414562546] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:38,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:38,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:38,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919131353] [2021-08-25 20:00:38,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:38,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:38,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:38,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:38,571 INFO L87 Difference]: Start difference. First operand 697 states and 955 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:00:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:38,770 INFO L93 Difference]: Finished difference Result 1508 states and 2127 transitions. [2021-08-25 20:00:38,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:38,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 173 [2021-08-25 20:00:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:38,774 INFO L225 Difference]: With dead ends: 1508 [2021-08-25 20:00:38,775 INFO L226 Difference]: Without dead ends: 844 [2021-08-25 20:00:38,776 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-08-25 20:00:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 814. [2021-08-25 20:00:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 1.4071340713407134) internal successors, (1144), 813 states have internal predecessors, (1144), 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:00:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1144 transitions. [2021-08-25 20:00:38,795 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1144 transitions. Word has length 173 [2021-08-25 20:00:38,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:38,796 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1144 transitions. [2021-08-25 20:00:38,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:00:38,796 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1144 transitions. [2021-08-25 20:00:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-08-25 20:00:38,798 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:38,799 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:38,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:00:38,799 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:38,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:38,800 INFO L82 PathProgramCache]: Analyzing trace with hash -598161639, now seen corresponding path program 2 times [2021-08-25 20:00:38,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:38,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009215415] [2021-08-25 20:00:38,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:38,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-08-25 20:00:38,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:38,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009215415] [2021-08-25 20:00:38,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009215415] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:38,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:38,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:38,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795220399] [2021-08-25 20:00:38,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:38,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:38,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:38,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:38,863 INFO L87 Difference]: Start difference. First operand 814 states and 1144 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:00:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:39,023 INFO L93 Difference]: Finished difference Result 1870 states and 2708 transitions. [2021-08-25 20:00:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:39,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 185 [2021-08-25 20:00:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:39,029 INFO L225 Difference]: With dead ends: 1870 [2021-08-25 20:00:39,029 INFO L226 Difference]: Without dead ends: 1041 [2021-08-25 20:00:39,030 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2021-08-25 20:00:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1003. [2021-08-25 20:00:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 1.3932135728542914) internal successors, (1396), 1002 states have internal predecessors, (1396), 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:00:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1396 transitions. [2021-08-25 20:00:39,050 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1396 transitions. Word has length 185 [2021-08-25 20:00:39,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:39,050 INFO L470 AbstractCegarLoop]: Abstraction has 1003 states and 1396 transitions. [2021-08-25 20:00:39,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:00:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1396 transitions. [2021-08-25 20:00:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-08-25 20:00:39,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:39,053 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:39,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:00:39,054 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:39,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash -759567935, now seen corresponding path program 1 times [2021-08-25 20:00:39,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:39,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293180000] [2021-08-25 20:00:39,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:39,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2021-08-25 20:00:39,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:39,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293180000] [2021-08-25 20:00:39,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293180000] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:39,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:39,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:39,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259254449] [2021-08-25 20:00:39,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:39,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:39,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:39,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:39,126 INFO L87 Difference]: Start difference. First operand 1003 states and 1396 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:00:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:39,156 INFO L93 Difference]: Finished difference Result 2282 states and 3180 transitions. [2021-08-25 20:00:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:39,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 194 [2021-08-25 20:00:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:39,161 INFO L225 Difference]: With dead ends: 2282 [2021-08-25 20:00:39,161 INFO L226 Difference]: Without dead ends: 1315 [2021-08-25 20:00:39,162 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2021-08-25 20:00:39,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1315. [2021-08-25 20:00:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1314 states have (on average 1.39117199391172) internal successors, (1828), 1314 states have internal predecessors, (1828), 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:00:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1828 transitions. [2021-08-25 20:00:39,191 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1828 transitions. Word has length 194 [2021-08-25 20:00:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:39,191 INFO L470 AbstractCegarLoop]: Abstraction has 1315 states and 1828 transitions. [2021-08-25 20:00:39,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:00:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1828 transitions. [2021-08-25 20:00:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-08-25 20:00:39,194 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:39,195 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:39,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:00:39,195 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:39,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:39,195 INFO L82 PathProgramCache]: Analyzing trace with hash -915330113, now seen corresponding path program 1 times [2021-08-25 20:00:39,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:39,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147718531] [2021-08-25 20:00:39,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:39,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-08-25 20:00:39,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:00:39,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147718531] [2021-08-25 20:00:39,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147718531] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:39,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:39,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:00:39,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346556564] [2021-08-25 20:00:39,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:39,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:00:39,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:39,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:39,249 INFO L87 Difference]: Start difference. First operand 1315 states and 1828 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:00:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:39,301 INFO L93 Difference]: Finished difference Result 3583 states and 5032 transitions. [2021-08-25 20:00:39,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:39,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 196 [2021-08-25 20:00:39,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:39,311 INFO L225 Difference]: With dead ends: 3583 [2021-08-25 20:00:39,311 INFO L226 Difference]: Without dead ends: 2325 [2021-08-25 20:00:39,314 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2021-08-25 20:00:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2323. [2021-08-25 20:00:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 2322 states have (on average 1.4061154177433248) internal successors, (3265), 2322 states have internal predecessors, (3265), 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:00:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3265 transitions. [2021-08-25 20:00:39,381 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3265 transitions. Word has length 196 [2021-08-25 20:00:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:39,381 INFO L470 AbstractCegarLoop]: Abstraction has 2323 states and 3265 transitions. [2021-08-25 20:00:39,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:00:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3265 transitions. [2021-08-25 20:00:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-08-25 20:00:39,385 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:39,386 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:39,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:00:39,386 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:39,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:39,387 INFO L82 PathProgramCache]: Analyzing trace with hash 342847369, now seen corresponding path program 1 times [2021-08-25 20:00:39,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:00:39,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853026855] [2021-08-25 20:00:39,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:39,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:00:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:00:39,425 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:00:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:00:39,547 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:00:39,547 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:00:39,548 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:00:39,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:00:39,554 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:00:39,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:00:39 BoogieIcfgContainer [2021-08-25 20:00:39,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:00:39,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:00:39,645 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:00:39,645 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:00:39,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:00:35" (3/4) ... [2021-08-25 20:00:39,648 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:00:39,648 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:00:39,649 INFO L168 Benchmark]: Toolchain (without parser) took 5864.96 ms. Allocated memory was 48.2 MB in the beginning and 148.9 MB in the end (delta: 100.7 MB). Free memory was 25.3 MB in the beginning and 99.7 MB in the end (delta: -74.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:39,649 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 48.2 MB. Free memory was 30.7 MB in the beginning and 30.6 MB in the end (delta: 37.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:00:39,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.12 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 25.0 MB in the beginning and 39.5 MB in the end (delta: -14.5 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:39,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.44 ms. Allocated memory is still 58.7 MB. Free memory was 39.5 MB in the beginning and 36.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:39,650 INFO L168 Benchmark]: Boogie Preprocessor took 48.69 ms. Allocated memory is still 58.7 MB. Free memory was 36.8 MB in the beginning and 34.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:39,650 INFO L168 Benchmark]: RCFGBuilder took 952.33 ms. Allocated memory is still 58.7 MB. Free memory was 34.8 MB in the beginning and 37.0 MB in the end (delta: -2.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:39,651 INFO L168 Benchmark]: TraceAbstraction took 4089.20 ms. Allocated memory was 58.7 MB in the beginning and 148.9 MB in the end (delta: 90.2 MB). Free memory was 36.4 MB in the beginning and 99.7 MB in the end (delta: -63.3 MB). Peak memory consumption was 75.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:00:39,651 INFO L168 Benchmark]: Witness Printer took 3.19 ms. Allocated memory is still 148.9 MB. Free memory is still 99.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:00:39,652 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.18 ms. Allocated memory is still 48.2 MB. Free memory was 30.7 MB in the beginning and 30.6 MB in the end (delta: 37.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 632.12 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 25.0 MB in the beginning and 39.5 MB in the end (delta: -14.5 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 130.44 ms. Allocated memory is still 58.7 MB. Free memory was 39.5 MB in the beginning and 36.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.69 ms. Allocated memory is still 58.7 MB. Free memory was 36.8 MB in the beginning and 34.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 952.33 ms. Allocated memory is still 58.7 MB. Free memory was 34.8 MB in the beginning and 37.0 MB in the end (delta: -2.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4089.20 ms. Allocated memory was 58.7 MB in the beginning and 148.9 MB in the end (delta: 90.2 MB). Free memory was 36.4 MB in the beginning and 99.7 MB in the end (delta: -63.3 MB). Peak memory consumption was 75.0 MB. Max. memory is 16.1 GB. * Witness Printer took 3.19 ms. Allocated memory is still 148.9 MB. Free memory is still 99.7 MB. There was no memory consumed. 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 - UnprovableResult [Line: 609]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseXor at line 357. Possible FailurePath: [L618] int __retres1 ; [L11] int s__info_callback = __VERIFIER_nondet_int(); [L12] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] unsigned int s__version = __VERIFIER_nondet_uint(); [L17] int s__type ; [L18] int s__init_num ; [L19] int s__bbio = __VERIFIER_nondet_int(); [L20] int s__wbio = __VERIFIER_nondet_int(); [L21] int s__hit = __VERIFIER_nondet_int(); [L22] int s__rwstate ; [L23] int s__init_buf___0 ; [L24] int s__debug = __VERIFIER_nondet_int(); [L25] int s__shutdown ; [L26] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L27] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L28] unsigned int s__ctx__stats__sess_connect ; [L29] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L30] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L31] int s__s3__change_cipher_spec ; [L32] int s__s3__flags ; [L33] int s__s3__delay_buf_pop_ret ; [L34] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L41] int s__session__cipher ; [L42] int s__session__compress_meth ; [L43] int buf ; [L44] unsigned long tmp ; [L45] unsigned long l ; [L46] int num1 ; [L47] int cb ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int tmp___0 ; [L53] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L54] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L55] int tmp___3 = __VERIFIER_nondet_int(); [L56] int tmp___4 = __VERIFIER_nondet_int(); [L57] int tmp___5 = __VERIFIER_nondet_int(); [L58] int tmp___6 = __VERIFIER_nondet_int(); [L59] int tmp___7 = __VERIFIER_nondet_int(); [L60] int tmp___8 = __VERIFIER_nondet_int(); [L61] int tmp___9 = __VERIFIER_nondet_int(); [L62] int blastFlag ; [L63] int ag_X ; [L64] int ag_Y = __VERIFIER_nondet_int(); [L65] int __retres59 ; [L68] s__state = 12292 [L69] blastFlag = 0 [L70] tmp = __VERIFIER_nondet_int() [L71] cb = 0 [L72] ret = -1 [L73] skip = 0 [L74] tmp___0 = 0 [L75] COND TRUE s__info_callback != 0 [L76] cb = s__info_callback [L84] s__in_handshake = s__in_handshake + 1 [L85] COND FALSE !(tmp___1 - 12288) [L95] COND TRUE 1 [L97] state = s__state [L98] COND TRUE s__state == 12292 [L201] s__new_session = 1 [L202] s__state = 4096 [L203] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L208] s__server = 0 [L209] COND TRUE cb != 0 [L214] COND FALSE !(s__version - 65280 != 768) [L220] s__type = 4096 [L221] COND FALSE !(s__init_buf___0 == 0) [L239] COND FALSE !(! tmp___4) [L245] COND FALSE !(! tmp___5) [L251] s__state = 4368 [L252] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L253] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND TRUE s__state == 4368 [L257] s__shutdown = 0 [L258] ret = __VERIFIER_nondet_int() [L259] COND TRUE blastFlag == 0 [L260] blastFlag = 1 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] s__init_num = 0 [L275] COND TRUE s__bbio != s__wbio [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND TRUE s__state == 4384 [L283] ret = __VERIFIER_nondet_int() [L284] COND TRUE blastFlag == 1 [L285] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 4400 [L299] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND TRUE s__state == 4400 [L303] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L306] ret = __VERIFIER_nondet_int() [L307] COND TRUE blastFlag == 2 [L308] blastFlag = 3 [L312] COND FALSE !(ret <= 0) [L318] s__state = 4416 [L319] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND TRUE s__state == 4416 [L323] ret = __VERIFIER_nondet_int() [L324] COND TRUE blastFlag == 3 [L325] blastFlag = 4 [L329] COND FALSE !(ret <= 0) [L334] s__state = 4432 [L335] ag_X = (unsigned short)65535 [L336] s__init_num = 0 [L337] COND FALSE !(! tmp___6) [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND FALSE !(s__state == 4416) [L134] COND FALSE !(s__state == 4417) [L137] COND TRUE s__state == 4432 [L346] ret = __VERIFIER_nondet_int() [L347] COND FALSE !(blastFlag == 5) [L352] COND FALSE !(ret <= 0) [L357] s__state = ag_X ^ ag_Y [L358] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND TRUE s__state == 4368 [L257] s__shutdown = 0 [L258] ret = __VERIFIER_nondet_int() [L259] COND FALSE !(blastFlag == 0) [L262] COND TRUE blastFlag == 4 [L263] blastFlag = 5 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] s__init_num = 0 [L275] COND TRUE s__bbio != s__wbio [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND TRUE s__state == 4384 [L283] ret = __VERIFIER_nondet_int() [L284] COND FALSE !(blastFlag == 1) [L289] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 4400 [L299] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND TRUE s__state == 4400 [L303] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L306] ret = __VERIFIER_nondet_int() [L307] COND FALSE !(blastFlag == 2) [L312] COND FALSE !(ret <= 0) [L318] s__state = 4416 [L319] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND TRUE s__state == 4416 [L323] ret = __VERIFIER_nondet_int() [L324] COND FALSE !(blastFlag == 3) [L329] COND FALSE !(ret <= 0) [L334] s__state = 4432 [L335] ag_X = (unsigned short)65535 [L336] s__init_num = 0 [L337] COND FALSE !(! tmp___6) [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND FALSE !(s__state == 4416) [L134] COND FALSE !(s__state == 4417) [L137] COND TRUE s__state == 4432 [L346] ret = __VERIFIER_nondet_int() [L347] COND TRUE blastFlag == 5 [L609] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3925.7ms, OverallIterations: 15, TraceHistogramMax: 11, EmptinessCheckTime: 44.2ms, AutomataDifference: 2002.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2634 SDtfs, 812 SDslu, 1502 SDs, 0 SdLazy, 896 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1153.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2323occurred in iteration=14, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 309.2ms AutomataMinimizationTime, 14 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 63.2ms SsaConstructionTime, 324.2ms SatisfiabilityAnalysisTime, 762.4ms InterpolantComputationTime, 1686 NumberOfCodeBlocks, 1686 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1476 ConstructedInterpolants, 0 QuantifiedInterpolants, 2960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 2791/2791 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 could not prove your program: unable to determine feasibility of some traces [2021-08-25 20:00:39,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:00:42,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:00:42,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:00:42,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:00:42,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:00:42,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:00:42,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:00:42,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:00:42,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:00:42,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:00:42,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:00:42,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:00:42,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:00:42,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:00:42,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:00:42,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:00:42,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:00:42,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:00:42,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:00:42,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:00:42,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:00:42,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:00:42,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:00:42,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:00:42,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:00:42,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:00:42,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:00:42,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:00:42,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:00:42,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:00:42,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:00:42,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:00:42,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:00:42,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:00:42,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:00:42,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:00:42,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:00:42,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:00:42,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:00:42,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:00:42,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:00:42,406 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:00:42,442 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:00:42,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:00:42,443 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:00:42,443 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:00:42,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:00:42,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:00:42,445 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:00:42,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:00:42,446 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:00:42,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:00:42,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:00:42,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:00:42,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:00:42,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:00:42,447 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 20:00:42,448 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 20:00:42,448 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:00:42,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:00:42,448 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:00:42,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:00:42,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:00:42,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:00:42,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:00:42,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:00:42,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:00:42,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:00:42,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:00:42,459 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 20:00:42,459 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 20:00:42,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:00:42,460 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:00:42,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 20:00:42,460 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 -> 6995ed6ba91d7bb4325b7b2cb6cc1ca7ba7d3a61 [2021-08-25 20:00:42,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:00:42,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:00:42,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:00:42,798 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:00:42,800 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:00:42,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2021-08-25 20:00:42,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25f832de/c1ba94097f1c4521a00ddbb9391a97ea/FLAG1a9f118dd [2021-08-25 20:00:43,424 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:00:43,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2021-08-25 20:00:43,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25f832de/c1ba94097f1c4521a00ddbb9391a97ea/FLAG1a9f118dd [2021-08-25 20:00:43,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25f832de/c1ba94097f1c4521a00ddbb9391a97ea [2021-08-25 20:00:43,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:00:43,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:00:43,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:00:43,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:00:43,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:00:43,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:00:43" (1/1) ... [2021-08-25 20:00:43,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa74f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:43, skipping insertion in model container [2021-08-25 20:00:43,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:00:43" (1/1) ... [2021-08-25 20:00:43,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:00:43,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:00:44,153 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/s3_clnt_2.BV.c.cil-2a.c[37184,37197] [2021-08-25 20:00:44,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:00:44,198 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:00:44,249 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/s3_clnt_2.BV.c.cil-2a.c[37184,37197] [2021-08-25 20:00:44,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:00:44,292 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:00:44,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:44 WrapperNode [2021-08-25 20:00:44,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:00:44,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:00:44,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:00:44,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:00:44,299 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:00:44" (1/1) ... [2021-08-25 20:00:44,319 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:00:44" (1/1) ... [2021-08-25 20:00:44,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:00:44,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:00:44,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:00:44,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:00:44,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:44" (1/1) ... [2021-08-25 20:00:44,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:44" (1/1) ... [2021-08-25 20:00:44,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:44" (1/1) ... [2021-08-25 20:00:44,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:44" (1/1) ... [2021-08-25 20:00:44,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:44" (1/1) ... [2021-08-25 20:00:44,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:44" (1/1) ... [2021-08-25 20:00:44,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:44" (1/1) ... [2021-08-25 20:00:44,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:00:44,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:00:44,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:00:44,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:00:44,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:44" (1/1) ... [2021-08-25 20:00:44,446 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:00:44,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:00:44,477 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:00:44,509 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:00:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:00:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:00:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:00:44,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:00:44,786 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:00:45,422 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 20:00:45,422 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 20:00:45,431 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:00:45,432 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:00:45,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:00:45 BoogieIcfgContainer [2021-08-25 20:00:45,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:00:45,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:00:45,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:00:45,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:00:45,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:00:43" (1/3) ... [2021-08-25 20:00:45,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5164f2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:00:45, skipping insertion in model container [2021-08-25 20:00:45,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:00:44" (2/3) ... [2021-08-25 20:00:45,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5164f2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:00:45, skipping insertion in model container [2021-08-25 20:00:45,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:00:45" (3/3) ... [2021-08-25 20:00:45,442 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2021-08-25 20:00:45,446 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:00:45,446 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:00:45,498 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:00:45,504 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:00:45,504 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:00:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 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:00:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 20:00:45,543 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:45,543 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:45,544 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:45,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:45,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2021-08-25 20:00:45,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:45,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614163565] [2021-08-25 20:00:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:45,570 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:45,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:45,580 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:00:45,630 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:00:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:45,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:45,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:45,859 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:00:45,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:45,969 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:00:45,969 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:45,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614163565] [2021-08-25 20:00:45,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614163565] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:45,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:45,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:00:45,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223531551] [2021-08-25 20:00:45,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:45,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:45,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:45,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:45,989 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 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 8.0) internal successors, (24), 3 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:00:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:46,130 INFO L93 Difference]: Finished difference Result 246 states and 421 transitions. [2021-08-25 20:00:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:46,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 24 [2021-08-25 20:00:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:46,139 INFO L225 Difference]: With dead ends: 246 [2021-08-25 20:00:46,140 INFO L226 Difference]: Without dead ends: 112 [2021-08-25 20:00:46,142 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-08-25 20:00:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-08-25 20:00:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 111 states have internal predecessors, (169), 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:00:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2021-08-25 20:00:46,175 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2021-08-25 20:00:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:46,176 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2021-08-25 20:00:46,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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:00:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2021-08-25 20:00:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 20:00:46,177 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:46,178 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:46,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-25 20:00:46,388 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:00:46,389 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:46,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:46,390 INFO L82 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2021-08-25 20:00:46,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:46,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244543614] [2021-08-25 20:00:46,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:46,391 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:46,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:46,412 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:00:46,481 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:00:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:46,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:46,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:00:46,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:00:46,838 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:46,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244543614] [2021-08-25 20:00:46,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244543614] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:46,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:46,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:00:46,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470886634] [2021-08-25 20:00:46,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:46,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:46,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:46,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:46,842 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:47,086 INFO L93 Difference]: Finished difference Result 233 states and 356 transitions. [2021-08-25 20:00:47,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:47,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-08-25 20:00:47,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:47,087 INFO L225 Difference]: With dead ends: 233 [2021-08-25 20:00:47,088 INFO L226 Difference]: Without dead ends: 131 [2021-08-25 20:00:47,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-25 20:00:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2021-08-25 20:00:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5) internal successors, (189), 126 states have internal predecessors, (189), 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:00:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2021-08-25 20:00:47,098 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2021-08-25 20:00:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:47,098 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2021-08-25 20:00:47,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2021-08-25 20:00:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-25 20:00:47,100 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:47,100 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:47,116 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:00:47,311 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:00:47,311 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:47,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:47,312 INFO L82 PathProgramCache]: Analyzing trace with hash 213639527, now seen corresponding path program 1 times [2021-08-25 20:00:47,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:47,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277617811] [2021-08-25 20:00:47,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:47,313 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:47,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:47,315 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:00:47,333 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:00:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:47,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:47,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:00:47,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:00:47,979 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:47,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277617811] [2021-08-25 20:00:47,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277617811] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:47,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:47,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:00:47,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94591513] [2021-08-25 20:00:47,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:47,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:47,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:47,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:47,981 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:00:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:48,298 INFO L93 Difference]: Finished difference Result 265 states and 400 transitions. [2021-08-25 20:00:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:48,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 50 [2021-08-25 20:00:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:48,300 INFO L225 Difference]: With dead ends: 265 [2021-08-25 20:00:48,300 INFO L226 Difference]: Without dead ends: 148 [2021-08-25 20:00:48,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-08-25 20:00:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2021-08-25 20:00:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 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:00:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2021-08-25 20:00:48,307 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2021-08-25 20:00:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:48,307 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2021-08-25 20:00:48,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:00:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2021-08-25 20:00:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-25 20:00:48,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:48,309 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:48,332 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:00:48,521 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:00:48,525 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:48,526 INFO L82 PathProgramCache]: Analyzing trace with hash 370823208, now seen corresponding path program 1 times [2021-08-25 20:00:48,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:48,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485478391] [2021-08-25 20:00:48,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:48,527 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:48,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:48,528 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:00:48,567 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:00:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:48,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:48,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 20:00:48,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 20:00:49,493 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:49,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485478391] [2021-08-25 20:00:49,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485478391] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:49,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:49,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:00:49,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902100333] [2021-08-25 20:00:49,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:00:49,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:49,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:00:49,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:00:49,500 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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:00:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:49,913 INFO L93 Difference]: Finished difference Result 349 states and 534 transitions. [2021-08-25 20:00:49,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:00:49,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 67 [2021-08-25 20:00:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:49,915 INFO L225 Difference]: With dead ends: 349 [2021-08-25 20:00:49,915 INFO L226 Difference]: Without dead ends: 215 [2021-08-25 20:00:49,916 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:00:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-08-25 20:00:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 207. [2021-08-25 20:00:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.441747572815534) internal successors, (297), 206 states have internal predecessors, (297), 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:00:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 297 transitions. [2021-08-25 20:00:49,927 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 297 transitions. Word has length 67 [2021-08-25 20:00:49,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:49,927 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 297 transitions. [2021-08-25 20:00:49,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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:00:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2021-08-25 20:00:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-25 20:00:49,940 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:49,940 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:49,953 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:00:50,150 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:00:50,151 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:50,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:50,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1528022105, now seen corresponding path program 1 times [2021-08-25 20:00:50,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:50,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839813966] [2021-08-25 20:00:50,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:50,156 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:50,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:50,174 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:00:50,205 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:00:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:50,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:50,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 20:00:51,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 20:00:51,208 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:51,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839813966] [2021-08-25 20:00:51,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839813966] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:51,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:51,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:00:51,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205522002] [2021-08-25 20:00:51,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:51,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:51,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:51,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:51,210 INFO L87 Difference]: Start difference. First operand 207 states and 297 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:00:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:51,387 INFO L93 Difference]: Finished difference Result 427 states and 620 transitions. [2021-08-25 20:00:51,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:51,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 68 [2021-08-25 20:00:51,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:51,397 INFO L225 Difference]: With dead ends: 427 [2021-08-25 20:00:51,398 INFO L226 Difference]: Without dead ends: 230 [2021-08-25 20:00:51,401 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-25 20:00:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2021-08-25 20:00:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4266666666666667) internal successors, (321), 225 states have internal predecessors, (321), 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:00:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 321 transitions. [2021-08-25 20:00:51,424 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 321 transitions. Word has length 68 [2021-08-25 20:00:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:51,426 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 321 transitions. [2021-08-25 20:00:51,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:00:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 321 transitions. [2021-08-25 20:00:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:00:51,433 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:51,433 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:51,445 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:00:51,643 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:00:51,643 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:51,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1678422895, now seen corresponding path program 1 times [2021-08-25 20:00:51,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:51,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945463980] [2021-08-25 20:00:51,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:51,644 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:51,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:51,657 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:00:51,661 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:00:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:52,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:52,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-08-25 20:00:52,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-08-25 20:00:52,527 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:52,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945463980] [2021-08-25 20:00:52,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945463980] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:52,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:52,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:00:52,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677195629] [2021-08-25 20:00:52,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:52,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:52,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:52,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:52,532 INFO L87 Difference]: Start difference. First operand 226 states and 321 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:00:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:52,674 INFO L93 Difference]: Finished difference Result 466 states and 670 transitions. [2021-08-25 20:00:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:52,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 84 [2021-08-25 20:00:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:52,679 INFO L225 Difference]: With dead ends: 466 [2021-08-25 20:00:52,679 INFO L226 Difference]: Without dead ends: 250 [2021-08-25 20:00:52,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-08-25 20:00:52,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2021-08-25 20:00:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.410569105691057) internal successors, (347), 246 states have internal predecessors, (347), 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:00:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 347 transitions. [2021-08-25 20:00:52,709 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 347 transitions. Word has length 84 [2021-08-25 20:00:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:52,711 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 347 transitions. [2021-08-25 20:00:52,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:00:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 347 transitions. [2021-08-25 20:00:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:00:52,713 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:52,713 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:52,725 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:00:52,922 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:00:52,923 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:52,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:52,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1619803512, now seen corresponding path program 1 times [2021-08-25 20:00:52,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:52,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671419258] [2021-08-25 20:00:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:52,924 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:52,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:52,926 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:00:52,928 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:00:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:53,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:53,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 20:00:53,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 20:00:54,087 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:54,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671419258] [2021-08-25 20:00:54,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671419258] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:54,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:54,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:00:54,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592868362] [2021-08-25 20:00:54,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:00:54,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:54,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:00:54,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:00:54,090 INFO L87 Difference]: Start difference. First operand 247 states and 347 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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:00:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:54,160 INFO L93 Difference]: Finished difference Result 743 states and 1042 transitions. [2021-08-25 20:00:54,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:00:54,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 103 [2021-08-25 20:00:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:54,163 INFO L225 Difference]: With dead ends: 743 [2021-08-25 20:00:54,163 INFO L226 Difference]: Without dead ends: 506 [2021-08-25 20:00:54,164 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:00:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-08-25 20:00:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2021-08-25 20:00:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.39009900990099) internal successors, (702), 505 states have internal predecessors, (702), 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:00:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 702 transitions. [2021-08-25 20:00:54,178 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 702 transitions. Word has length 103 [2021-08-25 20:00:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:54,179 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 702 transitions. [2021-08-25 20:00:54,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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:00:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 702 transitions. [2021-08-25 20:00:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-25 20:00:54,181 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:54,181 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:54,194 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:00:54,397 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:00:54,397 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:54,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:54,398 INFO L82 PathProgramCache]: Analyzing trace with hash -847602632, now seen corresponding path program 1 times [2021-08-25 20:00:54,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:54,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770899449] [2021-08-25 20:00:54,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:54,399 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:54,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:54,404 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:00:54,433 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:00:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:54,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:54,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-25 20:00:55,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-25 20:00:55,612 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:55,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770899449] [2021-08-25 20:00:55,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770899449] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:55,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:55,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:00:55,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899284381] [2021-08-25 20:00:55,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:55,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:55,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:55,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:55,615 INFO L87 Difference]: Start difference. First operand 506 states and 702 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:00:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:55,646 INFO L93 Difference]: Finished difference Result 1023 states and 1418 transitions. [2021-08-25 20:00:55,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:55,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 103 [2021-08-25 20:00:55,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:55,650 INFO L225 Difference]: With dead ends: 1023 [2021-08-25 20:00:55,650 INFO L226 Difference]: Without dead ends: 527 [2021-08-25 20:00:55,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-08-25 20:00:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2021-08-25 20:00:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3859315589353611) internal successors, (729), 526 states have internal predecessors, (729), 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:00:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 729 transitions. [2021-08-25 20:00:55,667 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 729 transitions. Word has length 103 [2021-08-25 20:00:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:55,667 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 729 transitions. [2021-08-25 20:00:55,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:00:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 729 transitions. [2021-08-25 20:00:55,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-25 20:00:55,669 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:55,669 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:55,688 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:00:55,877 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:00:55,877 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:55,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1168582955, now seen corresponding path program 1 times [2021-08-25 20:00:55,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:55,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274518] [2021-08-25 20:00:55,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:55,879 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:55,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:55,880 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:00:55,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-25 20:00:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:56,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:56,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-08-25 20:00:56,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-08-25 20:00:57,076 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:57,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274518] [2021-08-25 20:00:57,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274518] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:57,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:57,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:00:57,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41302019] [2021-08-25 20:00:57,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:00:57,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:57,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:00:57,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:57,079 INFO L87 Difference]: Start difference. First operand 527 states and 729 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:57,104 INFO L93 Difference]: Finished difference Result 1070 states and 1478 transitions. [2021-08-25 20:00:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:00:57,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-08-25 20:00:57,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:57,108 INFO L225 Difference]: With dead ends: 1070 [2021-08-25 20:00:57,108 INFO L226 Difference]: Without dead ends: 553 [2021-08-25 20:00:57,109 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:00:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2021-08-25 20:00:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2021-08-25 20:00:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.3804347826086956) internal successors, (762), 552 states have internal predecessors, (762), 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:00:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 762 transitions. [2021-08-25 20:00:57,127 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 762 transitions. Word has length 104 [2021-08-25 20:00:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:57,127 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 762 transitions. [2021-08-25 20:00:57,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:00:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 762 transitions. [2021-08-25 20:00:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:00:57,129 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:57,129 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:57,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-25 20:00:57,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:00:57,340 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:57,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash -53319870, now seen corresponding path program 1 times [2021-08-25 20:00:57,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:57,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447766067] [2021-08-25 20:00:57,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:57,341 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:57,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:57,345 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:00:57,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-25 20:00:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:57,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:57,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:00:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-08-25 20:00:58,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:00:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-08-25 20:00:58,467 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:00:58,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447766067] [2021-08-25 20:00:58,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447766067] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:00:58,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:00:58,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:00:58,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794811402] [2021-08-25 20:00:58,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:00:58,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:00:58,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:00:58,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:00:58,470 INFO L87 Difference]: Start difference. First operand 553 states and 762 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:00:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:00:58,887 INFO L93 Difference]: Finished difference Result 1520 states and 2113 transitions. [2021-08-25 20:00:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:00:58,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 105 [2021-08-25 20:00:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:00:58,891 INFO L225 Difference]: With dead ends: 1520 [2021-08-25 20:00:58,891 INFO L226 Difference]: Without dead ends: 1003 [2021-08-25 20:00:58,892 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:00:58,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2021-08-25 20:00:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2021-08-25 20:00:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 1.3892215568862276) internal successors, (1392), 1002 states have internal predecessors, (1392), 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:00:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1392 transitions. [2021-08-25 20:00:58,945 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1392 transitions. Word has length 105 [2021-08-25 20:00:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:00:58,946 INFO L470 AbstractCegarLoop]: Abstraction has 1003 states and 1392 transitions. [2021-08-25 20:00:58,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:00:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1392 transitions. [2021-08-25 20:00:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-08-25 20:00:58,949 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:00:58,950 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:00:58,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-25 20:00:59,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:00:59,161 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:00:59,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:00:59,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1519363111, now seen corresponding path program 1 times [2021-08-25 20:00:59,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:00:59,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238787595] [2021-08-25 20:00:59,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:00:59,162 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:00:59,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:00:59,177 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:00:59,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-25 20:00:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:00:59,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:00:59,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:01:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-08-25 20:01:00,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:01:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-08-25 20:01:00,789 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:01:00,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238787595] [2021-08-25 20:01:00,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238787595] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:01:00,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:01:00,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:01:00,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245965917] [2021-08-25 20:01:00,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:01:00,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:01:00,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:01:00,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:01:00,794 INFO L87 Difference]: Start difference. First operand 1003 states and 1392 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:01:01,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:01:01,173 INFO L93 Difference]: Finished difference Result 2091 states and 2938 transitions. [2021-08-25 20:01:01,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:01:01,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 173 [2021-08-25 20:01:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:01:01,182 INFO L225 Difference]: With dead ends: 2091 [2021-08-25 20:01:01,182 INFO L226 Difference]: Without dead ends: 1124 [2021-08-25 20:01:01,183 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:01:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2021-08-25 20:01:01,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1095. [2021-08-25 20:01:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 1.3711151736745886) internal successors, (1500), 1094 states have internal predecessors, (1500), 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:01:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1500 transitions. [2021-08-25 20:01:01,220 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1500 transitions. Word has length 173 [2021-08-25 20:01:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:01:01,220 INFO L470 AbstractCegarLoop]: Abstraction has 1095 states and 1500 transitions. [2021-08-25 20:01:01,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:01:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1500 transitions. [2021-08-25 20:01:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-08-25 20:01:01,224 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:01:01,224 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:01:01,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-08-25 20:01:01,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:01:01,437 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:01:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:01:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash -759567935, now seen corresponding path program 1 times [2021-08-25 20:01:01,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:01:01,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245482770] [2021-08-25 20:01:01,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:01:01,439 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:01:01,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:01:01,453 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:01:01,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-25 20:01:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:01:02,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:01:02,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:01:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2021-08-25 20:01:02,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:01:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2021-08-25 20:01:03,447 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:01:03,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245482770] [2021-08-25 20:01:03,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245482770] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:01:03,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:01:03,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-25 20:01:03,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973216125] [2021-08-25 20:01:03,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:01:03,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:01:03,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:01:03,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:01:03,450 INFO L87 Difference]: Start difference. First operand 1095 states and 1500 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:01:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:01:03,483 INFO L93 Difference]: Finished difference Result 2409 states and 3304 transitions. [2021-08-25 20:01:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:01:03,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 194 [2021-08-25 20:01:03,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:01:03,488 INFO L225 Difference]: With dead ends: 2409 [2021-08-25 20:01:03,489 INFO L226 Difference]: Without dead ends: 1350 [2021-08-25 20:01:03,490 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:01:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2021-08-25 20:01:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2021-08-25 20:01:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1349 states have (on average 1.369162342475908) internal successors, (1847), 1349 states have internal predecessors, (1847), 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:01:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1847 transitions. [2021-08-25 20:01:03,526 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1847 transitions. Word has length 194 [2021-08-25 20:01:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:01:03,526 INFO L470 AbstractCegarLoop]: Abstraction has 1350 states and 1847 transitions. [2021-08-25 20:01:03,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:01:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1847 transitions. [2021-08-25 20:01:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-08-25 20:01:03,530 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:01:03,530 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:01:03,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-25 20:01:03,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:01:03,745 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:01:03,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:01:03,745 INFO L82 PathProgramCache]: Analyzing trace with hash 342847369, now seen corresponding path program 1 times [2021-08-25 20:01:03,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:01:03,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549960567] [2021-08-25 20:01:03,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:01:03,746 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:01:03,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:01:03,757 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:01:03,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-25 20:01:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:01:04,830 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:01:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:01:05,434 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-25 20:01:05,435 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:01:05,436 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:01:05,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-25 20:01:05,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:01:05,666 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:01:05,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:01:05 BoogieIcfgContainer [2021-08-25 20:01:05,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:01:05,860 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:01:05,860 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:01:05,861 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:01:05,861 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:00:45" (3/4) ... [2021-08-25 20:01:05,870 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:01:06,044 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:01:06,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:01:06,048 INFO L168 Benchmark]: Toolchain (without parser) took 22330.98 ms. Allocated memory was 54.5 MB in the beginning and 302.0 MB in the end (delta: 247.5 MB). Free memory was 31.2 MB in the beginning and 165.0 MB in the end (delta: -133.7 MB). Peak memory consumption was 113.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:01:06,048 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 54.5 MB. Free memory was 36.4 MB in the beginning and 36.4 MB in the end (delta: 37.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:01:06,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.95 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.1 MB in the beginning and 47.6 MB in the end (delta: -16.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:01:06,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.20 ms. Allocated memory is still 67.1 MB. Free memory was 47.6 MB in the beginning and 45.1 MB in the end (delta: 2.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:01:06,050 INFO L168 Benchmark]: Boogie Preprocessor took 60.33 ms. Allocated memory is still 67.1 MB. Free memory was 45.1 MB in the beginning and 43.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:01:06,051 INFO L168 Benchmark]: RCFGBuilder took 1012.73 ms. Allocated memory is still 67.1 MB. Free memory was 43.0 MB in the beginning and 45.7 MB in the end (delta: -2.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:01:06,051 INFO L168 Benchmark]: TraceAbstraction took 20423.67 ms. Allocated memory was 67.1 MB in the beginning and 302.0 MB in the end (delta: 234.9 MB). Free memory was 45.3 MB in the beginning and 186.0 MB in the end (delta: -140.7 MB). Peak memory consumption was 93.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:01:06,051 INFO L168 Benchmark]: Witness Printer took 183.99 ms. Allocated memory is still 302.0 MB. Free memory was 186.0 MB in the beginning and 165.0 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:01:06,054 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.16 ms. Allocated memory is still 54.5 MB. Free memory was 36.4 MB in the beginning and 36.4 MB in the end (delta: 37.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 564.95 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.1 MB in the beginning and 47.6 MB in the end (delta: -16.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.20 ms. Allocated memory is still 67.1 MB. Free memory was 47.6 MB in the beginning and 45.1 MB in the end (delta: 2.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.33 ms. Allocated memory is still 67.1 MB. Free memory was 45.1 MB in the beginning and 43.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1012.73 ms. Allocated memory is still 67.1 MB. Free memory was 43.0 MB in the beginning and 45.7 MB in the end (delta: -2.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20423.67 ms. Allocated memory was 67.1 MB in the beginning and 302.0 MB in the end (delta: 234.9 MB). Free memory was 45.3 MB in the beginning and 186.0 MB in the end (delta: -140.7 MB). Peak memory consumption was 93.5 MB. Max. memory is 16.1 GB. * Witness Printer took 183.99 ms. Allocated memory is still 302.0 MB. Free memory was 186.0 MB in the beginning and 165.0 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 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: 609]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L618] int __retres1 ; [L11] int s__info_callback = __VERIFIER_nondet_int(); [L12] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] unsigned int s__version = __VERIFIER_nondet_uint(); [L17] int s__type ; [L18] int s__init_num ; [L19] int s__bbio = __VERIFIER_nondet_int(); [L20] int s__wbio = __VERIFIER_nondet_int(); [L21] int s__hit = __VERIFIER_nondet_int(); [L22] int s__rwstate ; [L23] int s__init_buf___0 ; [L24] int s__debug = __VERIFIER_nondet_int(); [L25] int s__shutdown ; [L26] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L27] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L28] unsigned int s__ctx__stats__sess_connect ; [L29] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L30] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L31] int s__s3__change_cipher_spec ; [L32] int s__s3__flags ; [L33] int s__s3__delay_buf_pop_ret ; [L34] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L41] int s__session__cipher ; [L42] int s__session__compress_meth ; [L43] int buf ; [L44] unsigned long tmp ; [L45] unsigned long l ; [L46] int num1 ; [L47] int cb ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int tmp___0 ; [L53] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L54] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L55] int tmp___3 = __VERIFIER_nondet_int(); [L56] int tmp___4 = __VERIFIER_nondet_int(); [L57] int tmp___5 = __VERIFIER_nondet_int(); [L58] int tmp___6 = __VERIFIER_nondet_int(); [L59] int tmp___7 = __VERIFIER_nondet_int(); [L60] int tmp___8 = __VERIFIER_nondet_int(); [L61] int tmp___9 = __VERIFIER_nondet_int(); [L62] int blastFlag ; [L63] int ag_X ; [L64] int ag_Y = __VERIFIER_nondet_int(); [L65] int __retres59 ; [L68] s__state = 12292 [L69] blastFlag = 0 [L70] tmp = __VERIFIER_nondet_int() [L71] cb = 0 [L72] ret = -1 [L73] skip = 0 [L74] tmp___0 = 0 [L75] COND TRUE s__info_callback != 0 [L76] cb = s__info_callback [L84] s__in_handshake = s__in_handshake + 1 [L85] COND FALSE !(tmp___1 - 12288) [L95] COND TRUE 1 [L97] state = s__state [L98] COND TRUE s__state == 12292 [L201] s__new_session = 1 [L202] s__state = 4096 [L203] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L208] s__server = 0 [L209] COND TRUE cb != 0 [L214] COND FALSE !(s__version - 65280 != 768) [L220] s__type = 4096 [L221] COND FALSE !(s__init_buf___0 == 0) [L239] COND FALSE !(! tmp___4) [L245] COND FALSE !(! tmp___5) [L251] s__state = 4368 [L252] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L253] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND TRUE s__state == 4368 [L257] s__shutdown = 0 [L258] ret = __VERIFIER_nondet_int() [L259] COND TRUE blastFlag == 0 [L260] blastFlag = 1 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] s__init_num = 0 [L275] COND TRUE s__bbio != s__wbio [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND TRUE s__state == 4384 [L283] ret = __VERIFIER_nondet_int() [L284] COND TRUE blastFlag == 1 [L285] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 4400 [L299] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND TRUE s__state == 4400 [L303] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L306] ret = __VERIFIER_nondet_int() [L307] COND TRUE blastFlag == 2 [L308] blastFlag = 3 [L312] COND FALSE !(ret <= 0) [L318] s__state = 4416 [L319] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND TRUE s__state == 4416 [L323] ret = __VERIFIER_nondet_int() [L324] COND TRUE blastFlag == 3 [L325] blastFlag = 4 [L329] COND FALSE !(ret <= 0) [L334] s__state = 4432 [L335] ag_X = (unsigned short)65535 [L336] s__init_num = 0 [L337] COND FALSE !(! tmp___6) [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND FALSE !(s__state == 4416) [L134] COND FALSE !(s__state == 4417) [L137] COND TRUE s__state == 4432 [L346] ret = __VERIFIER_nondet_int() [L347] COND FALSE !(blastFlag == 5) [L352] COND FALSE !(ret <= 0) [L357] s__state = ag_X ^ ag_Y [L358] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND TRUE s__state == 4368 [L257] s__shutdown = 0 [L258] ret = __VERIFIER_nondet_int() [L259] COND FALSE !(blastFlag == 0) [L262] COND TRUE blastFlag == 4 [L263] blastFlag = 5 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] s__init_num = 0 [L275] COND TRUE s__bbio != s__wbio [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND TRUE s__state == 4384 [L283] ret = __VERIFIER_nondet_int() [L284] COND FALSE !(blastFlag == 1) [L289] COND FALSE !(ret <= 0) [L294] COND FALSE !(\read(s__hit)) [L297] s__state = 4400 [L299] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND TRUE s__state == 4400 [L303] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L306] ret = __VERIFIER_nondet_int() [L307] COND FALSE !(blastFlag == 2) [L312] COND FALSE !(ret <= 0) [L318] s__state = 4416 [L319] s__init_num = 0 [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND TRUE s__state == 4416 [L323] ret = __VERIFIER_nondet_int() [L324] COND FALSE !(blastFlag == 3) [L329] COND FALSE !(ret <= 0) [L334] s__state = 4432 [L335] ag_X = (unsigned short)65535 [L336] s__init_num = 0 [L337] COND FALSE !(! tmp___6) [L567] COND FALSE !(! s__s3__tmp__reuse_message) [L596] skip = 0 [L95] COND TRUE 1 [L97] state = s__state [L98] COND FALSE !(s__state == 12292) [L101] COND FALSE !(s__state == 16384) [L104] COND FALSE !(s__state == 4096) [L107] COND FALSE !(s__state == 20480) [L110] COND FALSE !(s__state == 4099) [L113] COND FALSE !(s__state == 4368) [L116] COND FALSE !(s__state == 4369) [L119] COND FALSE !(s__state == 4384) [L122] COND FALSE !(s__state == 4385) [L125] COND FALSE !(s__state == 4400) [L128] COND FALSE !(s__state == 4401) [L131] COND FALSE !(s__state == 4416) [L134] COND FALSE !(s__state == 4417) [L137] COND TRUE s__state == 4432 [L346] ret = __VERIFIER_nondet_int() [L347] COND TRUE blastFlag == 5 [L609] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20158.1ms, OverallIterations: 13, TraceHistogramMax: 11, EmptinessCheckTime: 61.0ms, AutomataDifference: 2488.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 14.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2289 SDtfs, 1120 SDslu, 1557 SDs, 0 SdLazy, 933 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1514.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2198 GetRequests, 2182 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 60.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1350occurred in iteration=12, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 269.8ms AutomataMinimizationTime, 12 MinimizatonAttempts, 52 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 439.8ms SsaConstructionTime, 677.6ms SatisfiabilityAnalysisTime, 7937.3ms InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2198 ConstructedInterpolants, 0 QuantifiedInterpolants, 3411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1930 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 3576/3576 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:01:06,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...