./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3a877d22 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/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 08:54:31,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 08:54:31,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 08:54:31,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 08:54:31,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 08:54:31,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 08:54:31,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 08:54:31,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 08:54:31,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 08:54:31,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 08:54:31,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 08:54:31,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 08:54:31,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 08:54:31,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 08:54:31,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 08:54:31,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 08:54:31,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 08:54:31,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 08:54:31,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 08:54:31,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 08:54:31,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 08:54:31,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 08:54:31,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 08:54:31,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 08:54:31,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 08:54:31,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 08:54:31,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 08:54:31,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 08:54:31,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 08:54:31,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 08:54:31,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 08:54:31,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 08:54:31,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 08:54:31,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 08:54:31,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 08:54:31,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 08:54:31,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 08:54:31,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 08:54:31,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 08:54:31,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 08:54:31,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 08:54:31,254 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 08:54:31,278 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 08:54:31,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 08:54:31,279 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 08:54:31,279 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 08:54:31,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 08:54:31,280 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 08:54:31,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 08:54:31,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 08:54:31,281 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 08:54:31,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 08:54:31,281 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 08:54:31,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 08:54:31,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 08:54:31,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 08:54:31,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 08:54:31,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 08:54:31,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 08:54:31,282 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 08:54:31,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 08:54:31,283 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 08:54:31,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 08:54:31,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 08:54:31,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 08:54:31,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 08:54:31,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:54:31,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 08:54:31,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 08:54:31,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 08:54:31,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 08:54:31,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 08:54:31,285 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 08:54:31,285 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 08:54:31,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 08:54:31,286 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 08:54:31,286 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2021-12-15 08:54:31,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 08:54:31,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 08:54:31,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 08:54:31,460 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 08:54:31,461 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 08:54:31,462 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-15 08:54:31,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9faf1ca2a/598e3de9ed554115a6300023b6bde6c9/FLAG55f7c9415 [2021-12-15 08:54:31,853 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 08:54:31,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-15 08:54:31,860 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9faf1ca2a/598e3de9ed554115a6300023b6bde6c9/FLAG55f7c9415 [2021-12-15 08:54:31,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9faf1ca2a/598e3de9ed554115a6300023b6bde6c9 [2021-12-15 08:54:31,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 08:54:31,872 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 08:54:31,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 08:54:31,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 08:54:31,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 08:54:31,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:54:31" (1/1) ... [2021-12-15 08:54:31,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36435074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:31, skipping insertion in model container [2021-12-15 08:54:31,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:54:31" (1/1) ... [2021-12-15 08:54:31,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 08:54:31,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 08:54:31,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2021-12-15 08:54:32,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:54:32,037 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 08:54:32,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2021-12-15 08:54:32,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:54:32,065 INFO L208 MainTranslator]: Completed translation [2021-12-15 08:54:32,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:32 WrapperNode [2021-12-15 08:54:32,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 08:54:32,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 08:54:32,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 08:54:32,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 08:54:32,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:32" (1/1) ... [2021-12-15 08:54:32,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:32" (1/1) ... [2021-12-15 08:54:32,093 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-15 08:54:32,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 08:54:32,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 08:54:32,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 08:54:32,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 08:54:32,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:32" (1/1) ... [2021-12-15 08:54:32,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:32" (1/1) ... [2021-12-15 08:54:32,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:32" (1/1) ... [2021-12-15 08:54:32,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:32" (1/1) ... [2021-12-15 08:54:32,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:32" (1/1) ... [2021-12-15 08:54:32,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:32" (1/1) ... [2021-12-15 08:54:32,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:32" (1/1) ... [2021-12-15 08:54:32,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 08:54:32,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 08:54:32,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 08:54:32,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 08:54:32,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:32" (1/1) ... [2021-12-15 08:54:32,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:54:32,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:54:32,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 08:54:32,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 08:54:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 08:54:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 08:54:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 08:54:32,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 08:54:32,254 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 08:54:32,255 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 08:54:32,418 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 08:54:32,422 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 08:54:32,423 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 08:54:32,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:54:32 BoogieIcfgContainer [2021-12-15 08:54:32,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 08:54:32,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 08:54:32,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 08:54:32,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 08:54:32,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:54:31" (1/3) ... [2021-12-15 08:54:32,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c28d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:54:32, skipping insertion in model container [2021-12-15 08:54:32,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:32" (2/3) ... [2021-12-15 08:54:32,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c28d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:54:32, skipping insertion in model container [2021-12-15 08:54:32,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:54:32" (3/3) ... [2021-12-15 08:54:32,429 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2021-12-15 08:54:32,432 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 08:54:32,433 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 08:54:32,460 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 08:54:32,465 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 08:54:32,465 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 08:54:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 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-12-15 08:54:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 08:54:32,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:32,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:32,480 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:32,484 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-12-15 08:54:32,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:32,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966319681] [2021-12-15 08:54:32,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:32,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:32,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:32,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966319681] [2021-12-15 08:54:32,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966319681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:32,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:32,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 08:54:32,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280702033] [2021-12-15 08:54:32,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:32,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 08:54:32,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:32,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 08:54:32,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 08:54:32,640 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:32,658 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-12-15 08:54:32,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 08:54:32,659 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-15 08:54:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:32,666 INFO L225 Difference]: With dead ends: 57 [2021-12-15 08:54:32,666 INFO L226 Difference]: Without dead ends: 38 [2021-12-15 08:54:32,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 08:54:32,674 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:32,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:54:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-15 08:54:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-15 08:54:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 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-12-15 08:54:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-12-15 08:54:32,703 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-12-15 08:54:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:32,703 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-12-15 08:54:32,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-12-15 08:54:32,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 08:54:32,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:32,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:32,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 08:54:32,706 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:32,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-12-15 08:54:32,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:32,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794314082] [2021-12-15 08:54:32,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:32,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:32,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:32,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794314082] [2021-12-15 08:54:32,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794314082] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:32,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:32,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 08:54:32,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575354808] [2021-12-15 08:54:32,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:32,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 08:54:32,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:32,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 08:54:32,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:54:32,869 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:32,980 INFO L93 Difference]: Finished difference Result 89 states and 156 transitions. [2021-12-15 08:54:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 08:54:32,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-15 08:54:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:32,984 INFO L225 Difference]: With dead ends: 89 [2021-12-15 08:54:32,984 INFO L226 Difference]: Without dead ends: 61 [2021-12-15 08:54:32,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:54:32,986 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:32,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-15 08:54:32,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2021-12-15 08:54:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 58 states have internal predecessors, (89), 0 states have call successors, (0), 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-12-15 08:54:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2021-12-15 08:54:32,993 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 12 [2021-12-15 08:54:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:32,993 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2021-12-15 08:54:32,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2021-12-15 08:54:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 08:54:32,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:32,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:32,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 08:54:32,994 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:32,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:32,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1336656122, now seen corresponding path program 1 times [2021-12-15 08:54:32,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:32,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509693790] [2021-12-15 08:54:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:32,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:54:33,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:33,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509693790] [2021-12-15 08:54:33,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509693790] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:33,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:33,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:54:33,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632920745] [2021-12-15 08:54:33,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:33,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:54:33,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:33,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:54:33,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:54:33,060 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:33,177 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2021-12-15 08:54:33,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:54:33,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 08:54:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:33,179 INFO L225 Difference]: With dead ends: 143 [2021-12-15 08:54:33,179 INFO L226 Difference]: Without dead ends: 105 [2021-12-15 08:54:33,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 08:54:33,180 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 85 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:33,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 156 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-15 08:54:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2021-12-15 08:54:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 0 states have call successors, (0), 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-12-15 08:54:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2021-12-15 08:54:33,186 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 18 [2021-12-15 08:54:33,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:33,186 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2021-12-15 08:54:33,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2021-12-15 08:54:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 08:54:33,187 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:33,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:33,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 08:54:33,188 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:33,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:33,188 INFO L85 PathProgramCache]: Analyzing trace with hash -640429161, now seen corresponding path program 1 times [2021-12-15 08:54:33,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:33,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604921171] [2021-12-15 08:54:33,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:33,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:54:33,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:33,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604921171] [2021-12-15 08:54:33,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604921171] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:33,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:33,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:54:33,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001544342] [2021-12-15 08:54:33,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:33,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:54:33,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:33,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:54:33,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:54:33,260 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:33,373 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2021-12-15 08:54:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:54:33,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 08:54:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:33,374 INFO L225 Difference]: With dead ends: 169 [2021-12-15 08:54:33,374 INFO L226 Difference]: Without dead ends: 125 [2021-12-15 08:54:33,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 08:54:33,375 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 89 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:33,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 164 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-15 08:54:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 77. [2021-12-15 08:54:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 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-12-15 08:54:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2021-12-15 08:54:33,380 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 19 [2021-12-15 08:54:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:33,381 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2021-12-15 08:54:33,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2021-12-15 08:54:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 08:54:33,382 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:33,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:33,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 08:54:33,382 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:33,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash -170409323, now seen corresponding path program 1 times [2021-12-15 08:54:33,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:33,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797931177] [2021-12-15 08:54:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:33,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:54:33,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:33,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797931177] [2021-12-15 08:54:33,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797931177] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:33,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:33,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 08:54:33,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198725885] [2021-12-15 08:54:33,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:33,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 08:54:33,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:33,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 08:54:33,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:54:33,421 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:33,430 INFO L93 Difference]: Finished difference Result 124 states and 180 transitions. [2021-12-15 08:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 08:54:33,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-15 08:54:33,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:33,431 INFO L225 Difference]: With dead ends: 124 [2021-12-15 08:54:33,431 INFO L226 Difference]: Without dead ends: 60 [2021-12-15 08:54:33,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:54:33,437 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:33,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:54:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-15 08:54:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-12-15 08:54:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 0 states have call successors, (0), 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-12-15 08:54:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2021-12-15 08:54:33,440 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 20 [2021-12-15 08:54:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:33,441 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2021-12-15 08:54:33,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2021-12-15 08:54:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 08:54:33,442 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:33,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:33,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 08:54:33,442 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:33,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:33,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1388506533, now seen corresponding path program 1 times [2021-12-15 08:54:33,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:33,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006658236] [2021-12-15 08:54:33,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:33,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:33,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:33,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006658236] [2021-12-15 08:54:33,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006658236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:33,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:33,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 08:54:33,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556888065] [2021-12-15 08:54:33,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:33,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 08:54:33,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:33,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 08:54:33,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:54:33,494 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:33,500 INFO L93 Difference]: Finished difference Result 81 states and 115 transitions. [2021-12-15 08:54:33,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 08:54:33,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 08:54:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:33,500 INFO L225 Difference]: With dead ends: 81 [2021-12-15 08:54:33,501 INFO L226 Difference]: Without dead ends: 70 [2021-12-15 08:54:33,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:54:33,501 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:33,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:54:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-15 08:54:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-15 08:54:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 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-12-15 08:54:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2021-12-15 08:54:33,505 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 26 [2021-12-15 08:54:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:33,506 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2021-12-15 08:54:33,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2021-12-15 08:54:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 08:54:33,506 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:33,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:33,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 08:54:33,507 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:33,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1130341095, now seen corresponding path program 1 times [2021-12-15 08:54:33,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:33,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235015180] [2021-12-15 08:54:33,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:33,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:33,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:33,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235015180] [2021-12-15 08:54:33,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235015180] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:54:33,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481115479] [2021-12-15 08:54:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:33,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:33,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:54:33,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:54:33,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 08:54:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:33,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 08:54:33,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:33,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:33,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481115479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:33,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 08:54:33,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-15 08:54:33,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912835877] [2021-12-15 08:54:33,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:33,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:54:33,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:54:33,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-15 08:54:33,735 INFO L87 Difference]: Start difference. First operand 70 states and 99 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:33,849 INFO L93 Difference]: Finished difference Result 156 states and 254 transitions. [2021-12-15 08:54:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:54:33,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 08:54:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:33,850 INFO L225 Difference]: With dead ends: 156 [2021-12-15 08:54:33,850 INFO L226 Difference]: Without dead ends: 122 [2021-12-15 08:54:33,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-15 08:54:33,850 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:33,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 59 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-15 08:54:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 102. [2021-12-15 08:54:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 0 states have call successors, (0), 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-12-15 08:54:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2021-12-15 08:54:33,855 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 26 [2021-12-15 08:54:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:33,855 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2021-12-15 08:54:33,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2021-12-15 08:54:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-15 08:54:33,856 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:33,856 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:33,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:34,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:34,073 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:34,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1226843574, now seen corresponding path program 1 times [2021-12-15 08:54:34,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:34,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80802599] [2021-12-15 08:54:34,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:34,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:34,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:34,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80802599] [2021-12-15 08:54:34,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80802599] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:54:34,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310029425] [2021-12-15 08:54:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:34,169 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:34,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:54:34,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:54:34,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 08:54:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:34,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 08:54:34,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:54:34,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:34,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310029425] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:34,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 08:54:34,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-12-15 08:54:34,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135308057] [2021-12-15 08:54:34,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:34,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 08:54:34,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:34,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 08:54:34,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:54:34,416 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:34,485 INFO L93 Difference]: Finished difference Result 196 states and 271 transitions. [2021-12-15 08:54:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 08:54:34,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-15 08:54:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:34,486 INFO L225 Difference]: With dead ends: 196 [2021-12-15 08:54:34,486 INFO L226 Difference]: Without dead ends: 104 [2021-12-15 08:54:34,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-15 08:54:34,487 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 66 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:34,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 46 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:34,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-15 08:54:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2021-12-15 08:54:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 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-12-15 08:54:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2021-12-15 08:54:34,491 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 32 [2021-12-15 08:54:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:34,491 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2021-12-15 08:54:34,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2021-12-15 08:54:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 08:54:34,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:34,492 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-15 08:54:34,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:34,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-15 08:54:34,699 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:34,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:34,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2087313480, now seen corresponding path program 1 times [2021-12-15 08:54:34,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:34,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448645284] [2021-12-15 08:54:34,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:34,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:34,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:34,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448645284] [2021-12-15 08:54:34,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448645284] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:54:34,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959170892] [2021-12-15 08:54:34,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:34,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:34,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:54:34,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:54:34,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 08:54:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:34,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 08:54:34,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 08:54:34,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:34,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959170892] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:34,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 08:54:34,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-15 08:54:34,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299439484] [2021-12-15 08:54:34,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:34,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:54:34,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:34,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:54:34,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 08:54:34,980 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:35,031 INFO L93 Difference]: Finished difference Result 190 states and 260 transitions. [2021-12-15 08:54:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:54:35,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-15 08:54:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:35,032 INFO L225 Difference]: With dead ends: 190 [2021-12-15 08:54:35,032 INFO L226 Difference]: Without dead ends: 116 [2021-12-15 08:54:35,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 08:54:35,033 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:35,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 44 Invalid, 0 Unknown, 43 Unchecked, 0.0s Time] [2021-12-15 08:54:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-15 08:54:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2021-12-15 08:54:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 0 states have call successors, (0), 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-12-15 08:54:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2021-12-15 08:54:35,036 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 39 [2021-12-15 08:54:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:35,036 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2021-12-15 08:54:35,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2021-12-15 08:54:35,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-15 08:54:35,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:35,037 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:35,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-15 08:54:35,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:35,241 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash -317672729, now seen corresponding path program 1 times [2021-12-15 08:54:35,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:35,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452106657] [2021-12-15 08:54:35,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:35,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 08:54:35,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:35,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452106657] [2021-12-15 08:54:35,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452106657] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:54:35,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294637082] [2021-12-15 08:54:35,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:35,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:35,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:54:35,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:54:35,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 08:54:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:35,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-15 08:54:35,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 08:54:35,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:54:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:35,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294637082] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:54:35,830 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:54:35,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10] total 18 [2021-12-15 08:54:35,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340677809] [2021-12-15 08:54:35,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:54:35,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-15 08:54:35,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-15 08:54:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-12-15 08:54:35,831 INFO L87 Difference]: Start difference. First operand 90 states and 118 transitions. Second operand has 18 states, 18 states have (on average 6.5) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 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-12-15 08:54:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:38,801 INFO L93 Difference]: Finished difference Result 465 states and 629 transitions. [2021-12-15 08:54:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-12-15 08:54:38,802 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.5) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 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 48 [2021-12-15 08:54:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:38,803 INFO L225 Difference]: With dead ends: 465 [2021-12-15 08:54:38,803 INFO L226 Difference]: Without dead ends: 366 [2021-12-15 08:54:38,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2100 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1162, Invalid=5158, Unknown=0, NotChecked=0, Total=6320 [2021-12-15 08:54:38,805 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 906 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:38,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [906 Valid, 174 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-15 08:54:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-12-15 08:54:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 148. [2021-12-15 08:54:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 147 states have internal predecessors, (192), 0 states have call successors, (0), 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-12-15 08:54:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2021-12-15 08:54:38,811 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 48 [2021-12-15 08:54:38,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:38,811 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2021-12-15 08:54:38,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.5) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 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-12-15 08:54:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2021-12-15 08:54:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-15 08:54:38,812 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:38,812 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-12-15 08:54:38,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:39,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:39,013 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:39,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:39,013 INFO L85 PathProgramCache]: Analyzing trace with hash 956090099, now seen corresponding path program 1 times [2021-12-15 08:54:39,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:39,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210304182] [2021-12-15 08:54:39,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:39,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:39,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:39,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210304182] [2021-12-15 08:54:39,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210304182] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:54:39,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513414724] [2021-12-15 08:54:39,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:39,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:39,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:54:39,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:54:39,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 08:54:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:39,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 08:54:39,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-15 08:54:39,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:39,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513414724] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:39,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 08:54:39,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-12-15 08:54:39,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720108028] [2021-12-15 08:54:39,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:39,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:54:39,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:39,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:54:39,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:54:39,257 INFO L87 Difference]: Start difference. First operand 148 states and 192 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:39,305 INFO L93 Difference]: Finished difference Result 359 states and 493 transitions. [2021-12-15 08:54:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:54:39,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-12-15 08:54:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:39,306 INFO L225 Difference]: With dead ends: 359 [2021-12-15 08:54:39,306 INFO L226 Difference]: Without dead ends: 229 [2021-12-15 08:54:39,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:54:39,307 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 35 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:39,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 83 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 42 Invalid, 0 Unknown, 100 Unchecked, 0.0s Time] [2021-12-15 08:54:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-15 08:54:39,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 182. [2021-12-15 08:54:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.3646408839779005) internal successors, (247), 181 states have internal predecessors, (247), 0 states have call successors, (0), 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-12-15 08:54:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 247 transitions. [2021-12-15 08:54:39,313 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 247 transitions. Word has length 52 [2021-12-15 08:54:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:39,313 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 247 transitions. [2021-12-15 08:54:39,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 247 transitions. [2021-12-15 08:54:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-15 08:54:39,315 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:39,315 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:39,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:39,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-15 08:54:39,523 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:39,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1567562908, now seen corresponding path program 1 times [2021-12-15 08:54:39,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:39,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728320428] [2021-12-15 08:54:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:39,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-15 08:54:39,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:39,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728320428] [2021-12-15 08:54:39,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728320428] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:54:39,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027764282] [2021-12-15 08:54:39,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:39,661 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:39,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:54:39,662 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:54:39,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 08:54:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:39,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 08:54:39,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-15 08:54:40,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:54:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-15 08:54:40,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027764282] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:54:40,114 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:54:40,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 14 [2021-12-15 08:54:40,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390551078] [2021-12-15 08:54:40,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:54:40,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 08:54:40,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 08:54:40,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-12-15 08:54:40,116 INFO L87 Difference]: Start difference. First operand 182 states and 247 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 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-12-15 08:54:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:40,519 INFO L93 Difference]: Finished difference Result 412 states and 560 transitions. [2021-12-15 08:54:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-15 08:54:40,520 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 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 61 [2021-12-15 08:54:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:40,520 INFO L225 Difference]: With dead ends: 412 [2021-12-15 08:54:40,520 INFO L226 Difference]: Without dead ends: 229 [2021-12-15 08:54:40,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2021-12-15 08:54:40,521 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 309 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:40,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 159 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 08:54:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-15 08:54:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 167. [2021-12-15 08:54:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.283132530120482) internal successors, (213), 166 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-12-15 08:54:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 213 transitions. [2021-12-15 08:54:40,526 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 213 transitions. Word has length 61 [2021-12-15 08:54:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:40,526 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 213 transitions. [2021-12-15 08:54:40,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 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-12-15 08:54:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 213 transitions. [2021-12-15 08:54:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-15 08:54:40,527 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:40,527 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 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] [2021-12-15 08:54:40,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:40,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:40,735 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:40,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1549171118, now seen corresponding path program 1 times [2021-12-15 08:54:40,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:40,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322169464] [2021-12-15 08:54:40,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:40,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-15 08:54:40,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:40,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322169464] [2021-12-15 08:54:40,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322169464] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:40,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:40,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 08:54:40,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707348481] [2021-12-15 08:54:40,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:40,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 08:54:40,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:40,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 08:54:40,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 08:54:40,800 INFO L87 Difference]: Start difference. First operand 167 states and 213 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:40,964 INFO L93 Difference]: Finished difference Result 639 states and 817 transitions. [2021-12-15 08:54:40,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 08:54:40,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-15 08:54:40,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:40,966 INFO L225 Difference]: With dead ends: 639 [2021-12-15 08:54:40,966 INFO L226 Difference]: Without dead ends: 491 [2021-12-15 08:54:40,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:54:40,967 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 135 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:40,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 200 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-12-15 08:54:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 167. [2021-12-15 08:54:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.283132530120482) internal successors, (213), 166 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-12-15 08:54:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 213 transitions. [2021-12-15 08:54:40,986 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 213 transitions. Word has length 65 [2021-12-15 08:54:40,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:40,989 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 213 transitions. [2021-12-15 08:54:40,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:40,989 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 213 transitions. [2021-12-15 08:54:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-15 08:54:40,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:40,990 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 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] [2021-12-15 08:54:40,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 08:54:40,990 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1895270938, now seen corresponding path program 1 times [2021-12-15 08:54:40,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:40,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938745730] [2021-12-15 08:54:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:40,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-15 08:54:41,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:41,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938745730] [2021-12-15 08:54:41,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938745730] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:41,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:41,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 08:54:41,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149787600] [2021-12-15 08:54:41,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:41,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 08:54:41,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:41,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 08:54:41,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 08:54:41,041 INFO L87 Difference]: Start difference. First operand 167 states and 213 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:41,100 INFO L93 Difference]: Finished difference Result 447 states and 546 transitions. [2021-12-15 08:54:41,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 08:54:41,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 66 [2021-12-15 08:54:41,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:41,102 INFO L225 Difference]: With dead ends: 447 [2021-12-15 08:54:41,102 INFO L226 Difference]: Without dead ends: 298 [2021-12-15 08:54:41,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:54:41,103 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 113 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:41,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 128 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:54:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-12-15 08:54:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 198. [2021-12-15 08:54:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 197 states have internal predecessors, (241), 0 states have call successors, (0), 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-12-15 08:54:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 241 transitions. [2021-12-15 08:54:41,109 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 241 transitions. Word has length 66 [2021-12-15 08:54:41,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:41,109 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 241 transitions. [2021-12-15 08:54:41,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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-12-15 08:54:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 241 transitions. [2021-12-15 08:54:41,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-15 08:54:41,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:41,110 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:41,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 08:54:41,110 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:41,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:41,111 INFO L85 PathProgramCache]: Analyzing trace with hash 511658858, now seen corresponding path program 1 times [2021-12-15 08:54:41,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:41,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130886941] [2021-12-15 08:54:41,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:41,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-15 08:54:41,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:41,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130886941] [2021-12-15 08:54:41,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130886941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:41,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:41,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 08:54:41,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639475478] [2021-12-15 08:54:41,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:41,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 08:54:41,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:41,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 08:54:41,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 08:54:41,174 INFO L87 Difference]: Start difference. First operand 198 states and 241 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:41,439 INFO L93 Difference]: Finished difference Result 960 states and 1167 transitions. [2021-12-15 08:54:41,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 08:54:41,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-12-15 08:54:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:41,442 INFO L225 Difference]: With dead ends: 960 [2021-12-15 08:54:41,442 INFO L226 Difference]: Without dead ends: 781 [2021-12-15 08:54:41,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-15 08:54:41,442 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 203 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:41,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 335 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 08:54:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2021-12-15 08:54:41,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 198. [2021-12-15 08:54:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 197 states have internal predecessors, (241), 0 states have call successors, (0), 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-12-15 08:54:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 241 transitions. [2021-12-15 08:54:41,450 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 241 transitions. Word has length 66 [2021-12-15 08:54:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:41,450 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 241 transitions. [2021-12-15 08:54:41,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 241 transitions. [2021-12-15 08:54:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-15 08:54:41,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:41,451 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:41,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 08:54:41,451 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash 309834924, now seen corresponding path program 1 times [2021-12-15 08:54:41,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:41,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900519296] [2021-12-15 08:54:41,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:41,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-15 08:54:41,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:41,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900519296] [2021-12-15 08:54:41,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900519296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:41,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:41,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 08:54:41,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535447757] [2021-12-15 08:54:41,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:41,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 08:54:41,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:41,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 08:54:41,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:54:41,530 INFO L87 Difference]: Start difference. First operand 198 states and 241 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:41,888 INFO L93 Difference]: Finished difference Result 974 states and 1182 transitions. [2021-12-15 08:54:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 08:54:41,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-12-15 08:54:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:41,890 INFO L225 Difference]: With dead ends: 974 [2021-12-15 08:54:41,890 INFO L226 Difference]: Without dead ends: 795 [2021-12-15 08:54:41,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-15 08:54:41,891 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 271 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:41,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 389 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 08:54:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2021-12-15 08:54:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 194. [2021-12-15 08:54:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.2279792746113989) internal successors, (237), 193 states have internal predecessors, (237), 0 states have call successors, (0), 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-12-15 08:54:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 237 transitions. [2021-12-15 08:54:41,900 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 237 transitions. Word has length 66 [2021-12-15 08:54:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:41,900 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 237 transitions. [2021-12-15 08:54:41,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 237 transitions. [2021-12-15 08:54:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-15 08:54:41,901 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:41,901 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:41,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 08:54:41,901 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:41,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:41,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1907153003, now seen corresponding path program 1 times [2021-12-15 08:54:41,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:41,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212331888] [2021-12-15 08:54:41,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:41,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-15 08:54:41,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:41,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212331888] [2021-12-15 08:54:41,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212331888] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:54:41,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764368552] [2021-12-15 08:54:41,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:41,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:41,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:54:41,971 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:54:41,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 08:54:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:42,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 08:54:42,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-15 08:54:42,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:54:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-15 08:54:42,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764368552] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:54:42,350 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:54:42,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-15 08:54:42,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111389718] [2021-12-15 08:54:42,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:54:42,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 08:54:42,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:42,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 08:54:42,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2021-12-15 08:54:42,351 INFO L87 Difference]: Start difference. First operand 194 states and 237 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 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-12-15 08:54:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:42,595 INFO L93 Difference]: Finished difference Result 780 states and 946 transitions. [2021-12-15 08:54:42,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 08:54:42,595 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 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-12-15 08:54:42,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:42,597 INFO L225 Difference]: With dead ends: 780 [2021-12-15 08:54:42,597 INFO L226 Difference]: Without dead ends: 601 [2021-12-15 08:54:42,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2021-12-15 08:54:42,597 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 340 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:42,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 164 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 08:54:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2021-12-15 08:54:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 484. [2021-12-15 08:54:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.2215320910973084) internal successors, (590), 483 states have internal predecessors, (590), 0 states have call successors, (0), 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-12-15 08:54:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 590 transitions. [2021-12-15 08:54:42,636 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 590 transitions. Word has length 68 [2021-12-15 08:54:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:42,636 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 590 transitions. [2021-12-15 08:54:42,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 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-12-15 08:54:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 590 transitions. [2021-12-15 08:54:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 08:54:42,637 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:42,637 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:42,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:42,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:42,854 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:42,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash 550790900, now seen corresponding path program 1 times [2021-12-15 08:54:42,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:42,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831495679] [2021-12-15 08:54:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:42,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-15 08:54:42,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:54:42,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831495679] [2021-12-15 08:54:42,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831495679] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:54:42,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314784945] [2021-12-15 08:54:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:42,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:54:42,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:54:42,942 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:54:42,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 08:54:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:43,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 08:54:43,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-15 08:54:43,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:54:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-15 08:54:44,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314784945] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:54:44,127 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:54:44,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2021-12-15 08:54:44,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920106489] [2021-12-15 08:54:44,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:54:44,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-15 08:54:44,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:54:44,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-15 08:54:44,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-12-15 08:54:44,128 INFO L87 Difference]: Start difference. First operand 484 states and 590 transitions. Second operand has 16 states, 16 states have (on average 6.5) internal successors, (104), 16 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-12-15 08:54:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:44,885 INFO L93 Difference]: Finished difference Result 1469 states and 1775 transitions. [2021-12-15 08:54:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-15 08:54:44,885 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.5) internal successors, (104), 16 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 70 [2021-12-15 08:54:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:44,888 INFO L225 Difference]: With dead ends: 1469 [2021-12-15 08:54:44,888 INFO L226 Difference]: Without dead ends: 1139 [2021-12-15 08:54:44,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 131 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2021-12-15 08:54:44,889 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 659 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:44,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [659 Valid, 310 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 511 Invalid, 0 Unknown, 82 Unchecked, 0.4s Time] [2021-12-15 08:54:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-12-15 08:54:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 778. [2021-12-15 08:54:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.2342342342342343) internal successors, (959), 777 states have internal predecessors, (959), 0 states have call successors, (0), 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-12-15 08:54:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 959 transitions. [2021-12-15 08:54:44,933 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 959 transitions. Word has length 70 [2021-12-15 08:54:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:44,933 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 959 transitions. [2021-12-15 08:54:44,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.5) internal successors, (104), 16 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-12-15 08:54:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 959 transitions. [2021-12-15 08:54:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 08:54:44,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:44,935 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:44,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:45,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-15 08:54:45,136 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:45,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash 605183798, now seen corresponding path program 1 times [2021-12-15 08:54:45,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:54:45,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490478801] [2021-12-15 08:54:45,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:45,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:54:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 08:54:45,155 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 08:54:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 08:54:45,192 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 08:54:45,192 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 08:54:45,194 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 08:54:45,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-15 08:54:45,197 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:45,199 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 08:54:45,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:54:45 BoogieIcfgContainer [2021-12-15 08:54:45,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 08:54:45,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 08:54:45,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 08:54:45,272 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 08:54:45,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:54:32" (3/4) ... [2021-12-15 08:54:45,275 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 08:54:45,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 08:54:45,275 INFO L158 Benchmark]: Toolchain (without parser) took 13403.22ms. Allocated memory was 113.2MB in the beginning and 222.3MB in the end (delta: 109.1MB). Free memory was 86.0MB in the beginning and 89.7MB in the end (delta: -3.7MB). Peak memory consumption was 104.1MB. Max. memory is 16.1GB. [2021-12-15 08:54:45,275 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 08:54:45,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.18ms. Allocated memory is still 113.2MB. Free memory was 86.0MB in the beginning and 86.9MB in the end (delta: -913.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 08:54:45,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.64ms. Allocated memory is still 113.2MB. Free memory was 86.9MB in the beginning and 85.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 08:54:45,276 INFO L158 Benchmark]: Boogie Preprocessor took 42.28ms. Allocated memory is still 113.2MB. Free memory was 85.0MB in the beginning and 83.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 08:54:45,276 INFO L158 Benchmark]: RCFGBuilder took 286.63ms. Allocated memory is still 113.2MB. Free memory was 83.7MB in the beginning and 71.5MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 08:54:45,277 INFO L158 Benchmark]: TraceAbstraction took 12846.74ms. Allocated memory was 113.2MB in the beginning and 222.3MB in the end (delta: 109.1MB). Free memory was 70.9MB in the beginning and 90.8MB in the end (delta: -19.9MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2021-12-15 08:54:45,277 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 222.3MB. Free memory was 90.8MB in the beginning and 89.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 08:54:45,283 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.18ms. Allocated memory is still 113.2MB. Free memory was 86.0MB in the beginning and 86.9MB in the end (delta: -913.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.64ms. Allocated memory is still 113.2MB. Free memory was 86.9MB in the beginning and 85.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.28ms. Allocated memory is still 113.2MB. Free memory was 85.0MB in the beginning and 83.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 286.63ms. Allocated memory is still 113.2MB. Free memory was 83.7MB in the beginning and 71.5MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12846.74ms. Allocated memory was 113.2MB in the beginning and 222.3MB in the end (delta: 109.1MB). Free memory was 70.9MB in the beginning and 90.8MB in the end (delta: -19.9MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 222.3MB. Free memory was 90.8MB in the beginning and 89.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116, overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, na=4, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, na=4, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, na=4, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, na=4, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=20838, r0=234770790] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=20838, r0=234770790] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=20838, r0=234770790] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=20838, r0=234770790] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=1, i=1, na=4, nb=1, partial_sum=20838, r0=234770790] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=234770790] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=234770790] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=234770790] [L85] COND TRUE i == (unsigned char)1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790, r1=82] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=82, r0=234770790, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=234770790, r1=82] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=234770790, r1=82] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=234770790, r1=82] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=234770790, r1=82] [L86] COND TRUE i == (unsigned char)2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=234770790, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L87] COND TRUE i == (unsigned char)3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=155, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\old(a)=234770789, \old(b)=155, \result=3, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=155, b0=155, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, partial_sum=13, r=3, r0=234770790, r1=82, r2=254, r3=13] [L130] RET, EXPR mp_add(a, b) [L130] r = mp_add(a, b) [L132] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 19, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3337 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3337 mSDsluCounter, 2743 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 225 IncrementalHoareTripleChecker+Unchecked, 1740 mSDsCounter, 500 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4233 IncrementalHoareTripleChecker+Invalid, 4958 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 500 mSolverCounterUnsat, 1003 mSDtfsCounter, 4233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 894 GetRequests, 682 SyntacticMatches, 23 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2432 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred in iteration=18, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 2559 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1232 NumberOfCodeBlocks, 1232 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1379 ConstructedInterpolants, 30 QuantifiedInterpolants, 7529 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1164 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 30 InterpolantComputations, 14 PerfectInterpolantSequences, 1125/1256 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-12-15 08:54:45,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 08:54:47,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 08:54:47,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 08:54:47,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 08:54:47,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 08:54:47,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 08:54:47,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 08:54:47,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 08:54:47,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 08:54:47,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 08:54:47,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 08:54:47,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 08:54:47,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 08:54:47,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 08:54:47,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 08:54:47,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 08:54:47,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 08:54:47,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 08:54:47,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 08:54:47,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 08:54:47,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 08:54:47,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 08:54:47,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 08:54:47,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 08:54:47,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 08:54:47,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 08:54:47,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 08:54:47,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 08:54:47,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 08:54:47,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 08:54:47,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 08:54:47,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 08:54:47,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 08:54:47,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 08:54:47,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 08:54:47,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 08:54:47,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 08:54:47,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 08:54:47,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 08:54:47,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 08:54:47,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 08:54:47,113 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-15 08:54:47,151 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 08:54:47,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 08:54:47,152 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 08:54:47,152 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 08:54:47,153 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 08:54:47,153 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 08:54:47,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 08:54:47,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 08:54:47,154 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 08:54:47,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 08:54:47,155 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 08:54:47,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 08:54:47,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 08:54:47,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 08:54:47,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 08:54:47,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 08:54:47,156 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 08:54:47,156 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-15 08:54:47,156 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-15 08:54:47,156 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 08:54:47,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 08:54:47,157 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 08:54:47,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 08:54:47,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 08:54:47,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 08:54:47,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 08:54:47,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:54:47,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 08:54:47,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 08:54:47,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 08:54:47,158 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-15 08:54:47,158 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-15 08:54:47,158 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 08:54:47,159 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 08:54:47,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 08:54:47,159 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 08:54:47,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-15 08:54:47,159 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2021-12-15 08:54:47,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 08:54:47,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 08:54:47,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 08:54:47,455 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 08:54:47,455 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 08:54:47,456 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-15 08:54:47,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9bdb716/95c0dc8b3d92478d9d3e21507efcef72/FLAG3a94a9f83 [2021-12-15 08:54:47,878 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 08:54:47,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-15 08:54:47,888 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9bdb716/95c0dc8b3d92478d9d3e21507efcef72/FLAG3a94a9f83 [2021-12-15 08:54:47,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9bdb716/95c0dc8b3d92478d9d3e21507efcef72 [2021-12-15 08:54:47,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 08:54:47,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 08:54:47,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 08:54:47,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 08:54:47,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 08:54:47,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:54:47" (1/1) ... [2021-12-15 08:54:47,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eebb20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:47, skipping insertion in model container [2021-12-15 08:54:47,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:54:47" (1/1) ... [2021-12-15 08:54:47,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 08:54:47,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 08:54:48,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2021-12-15 08:54:48,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:54:48,131 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 08:54:48,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2021-12-15 08:54:48,173 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:54:48,189 INFO L208 MainTranslator]: Completed translation [2021-12-15 08:54:48,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:48 WrapperNode [2021-12-15 08:54:48,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 08:54:48,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 08:54:48,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 08:54:48,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 08:54:48,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:48" (1/1) ... [2021-12-15 08:54:48,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:48" (1/1) ... [2021-12-15 08:54:48,229 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-15 08:54:48,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 08:54:48,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 08:54:48,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 08:54:48,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 08:54:48,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:48" (1/1) ... [2021-12-15 08:54:48,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:48" (1/1) ... [2021-12-15 08:54:48,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:48" (1/1) ... [2021-12-15 08:54:48,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:48" (1/1) ... [2021-12-15 08:54:48,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:48" (1/1) ... [2021-12-15 08:54:48,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:48" (1/1) ... [2021-12-15 08:54:48,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:48" (1/1) ... [2021-12-15 08:54:48,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 08:54:48,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 08:54:48,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 08:54:48,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 08:54:48,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:48" (1/1) ... [2021-12-15 08:54:48,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:54:48,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:54:48,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 08:54:48,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 08:54:48,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 08:54:48,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-15 08:54:48,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 08:54:48,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 08:54:48,433 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 08:54:48,434 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 08:54:48,658 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 08:54:48,662 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 08:54:48,662 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 08:54:48,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:54:48 BoogieIcfgContainer [2021-12-15 08:54:48,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 08:54:48,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 08:54:48,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 08:54:48,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 08:54:48,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:54:47" (1/3) ... [2021-12-15 08:54:48,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b11009d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:54:48, skipping insertion in model container [2021-12-15 08:54:48,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:54:48" (2/3) ... [2021-12-15 08:54:48,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b11009d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:54:48, skipping insertion in model container [2021-12-15 08:54:48,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:54:48" (3/3) ... [2021-12-15 08:54:48,669 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2021-12-15 08:54:48,672 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 08:54:48,672 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 08:54:48,713 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 08:54:48,719 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 08:54:48,719 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 08:54:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 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-12-15 08:54:48,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 08:54:48,733 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:48,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:48,734 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:48,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:48,737 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-12-15 08:54:48,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:48,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885186077] [2021-12-15 08:54:48,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:48,745 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:48,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:48,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:48,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-15 08:54:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:48,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-15 08:54:48,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:48,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:48,854 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:48,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885186077] [2021-12-15 08:54:48,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885186077] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:48,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:48,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 08:54:48,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241015834] [2021-12-15 08:54:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:48,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 08:54:48,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:48,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 08:54:48,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 08:54:48,878 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:48,892 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-12-15 08:54:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 08:54:48,894 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-15 08:54:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:48,900 INFO L225 Difference]: With dead ends: 57 [2021-12-15 08:54:48,900 INFO L226 Difference]: Without dead ends: 38 [2021-12-15 08:54:48,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 08:54:48,905 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:48,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:54:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-15 08:54:48,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-15 08:54:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 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-12-15 08:54:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-12-15 08:54:48,929 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-12-15 08:54:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:48,929 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-12-15 08:54:48,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-12-15 08:54:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 08:54:48,930 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:48,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:48,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:49,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:49,137 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:49,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:49,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-12-15 08:54:49,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:49,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152644668] [2021-12-15 08:54:49,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:49,139 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:49,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:49,140 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:49,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-15 08:54:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:49,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 08:54:49,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:49,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:49,270 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:49,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152644668] [2021-12-15 08:54:49,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152644668] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:49,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:49,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:54:49,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560620540] [2021-12-15 08:54:49,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:49,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:54:49,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:49,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:54:49,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:54:49,275 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:49,427 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2021-12-15 08:54:49,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:54:49,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-15 08:54:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:49,428 INFO L225 Difference]: With dead ends: 116 [2021-12-15 08:54:49,428 INFO L226 Difference]: Without dead ends: 88 [2021-12-15 08:54:49,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:54:49,430 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:49,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 152 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-15 08:54:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2021-12-15 08:54:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 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-12-15 08:54:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2021-12-15 08:54:49,438 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 12 [2021-12-15 08:54:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:49,438 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2021-12-15 08:54:49,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2021-12-15 08:54:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 08:54:49,439 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:49,439 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:49,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-15 08:54:49,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:49,646 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:49,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:49,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2021-12-15 08:54:49,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:49,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529092217] [2021-12-15 08:54:49,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:49,647 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:49,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:49,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:49,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-15 08:54:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:49,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 08:54:49,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:49,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:49,707 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:49,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529092217] [2021-12-15 08:54:49,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529092217] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:49,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:49,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 08:54:49,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649115864] [2021-12-15 08:54:49,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:49,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 08:54:49,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:49,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 08:54:49,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 08:54:49,709 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:49,792 INFO L93 Difference]: Finished difference Result 164 states and 271 transitions. [2021-12-15 08:54:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 08:54:49,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-15 08:54:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:49,793 INFO L225 Difference]: With dead ends: 164 [2021-12-15 08:54:49,794 INFO L226 Difference]: Without dead ends: 136 [2021-12-15 08:54:49,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 08:54:49,795 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 141 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:49,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 284 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:49,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-15 08:54:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2021-12-15 08:54:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 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-12-15 08:54:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2021-12-15 08:54:49,801 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 13 [2021-12-15 08:54:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:49,801 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2021-12-15 08:54:49,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2021-12-15 08:54:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 08:54:49,802 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:49,802 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:49,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:50,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:50,008 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash 583572890, now seen corresponding path program 1 times [2021-12-15 08:54:50,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:50,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634748325] [2021-12-15 08:54:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:50,009 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:50,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:50,015 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:50,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-15 08:54:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:50,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 08:54:50,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:50,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:50,101 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:50,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634748325] [2021-12-15 08:54:50,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634748325] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:50,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:50,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 08:54:50,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900216345] [2021-12-15 08:54:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:50,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 08:54:50,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 08:54:50,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-15 08:54:50,103 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:50,294 INFO L93 Difference]: Finished difference Result 212 states and 341 transitions. [2021-12-15 08:54:50,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 08:54:50,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-15 08:54:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:50,296 INFO L225 Difference]: With dead ends: 212 [2021-12-15 08:54:50,296 INFO L226 Difference]: Without dead ends: 184 [2021-12-15 08:54:50,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-15 08:54:50,297 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 166 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:50,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 559 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 08:54:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-15 08:54:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 81. [2021-12-15 08:54:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 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-12-15 08:54:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2021-12-15 08:54:50,304 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 14 [2021-12-15 08:54:50,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:50,304 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2021-12-15 08:54:50,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2021-12-15 08:54:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 08:54:50,305 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:50,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:50,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:50,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:50,512 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:50,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1392919516, now seen corresponding path program 1 times [2021-12-15 08:54:50,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:50,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433272964] [2021-12-15 08:54:50,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:50,515 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:50,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:50,517 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:50,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-15 08:54:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:50,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 08:54:50,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:50,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:50,599 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:50,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433272964] [2021-12-15 08:54:50,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433272964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:50,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:50,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 08:54:50,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6426019] [2021-12-15 08:54:50,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:50,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 08:54:50,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 08:54:50,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:54:50,601 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:50,704 INFO L93 Difference]: Finished difference Result 227 states and 354 transitions. [2021-12-15 08:54:50,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 08:54:50,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-15 08:54:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:50,705 INFO L225 Difference]: With dead ends: 227 [2021-12-15 08:54:50,705 INFO L226 Difference]: Without dead ends: 199 [2021-12-15 08:54:50,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:54:50,706 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 233 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:50,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 683 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-15 08:54:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 87. [2021-12-15 08:54:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.5) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 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-12-15 08:54:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2021-12-15 08:54:50,713 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 14 [2021-12-15 08:54:50,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:50,714 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2021-12-15 08:54:50,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2021-12-15 08:54:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 08:54:50,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:50,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:50,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:50,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:50,927 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2021-12-15 08:54:50,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:50,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604625718] [2021-12-15 08:54:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:50,929 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:50,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:50,930 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:50,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-15 08:54:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:50,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 08:54:50,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:50,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:51,000 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:51,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604625718] [2021-12-15 08:54:51,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604625718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:51,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:51,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:54:51,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563157218] [2021-12-15 08:54:51,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:51,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:54:51,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:51,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:54:51,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:54:51,002 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:51,083 INFO L93 Difference]: Finished difference Result 243 states and 358 transitions. [2021-12-15 08:54:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:54:51,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-15 08:54:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:51,085 INFO L225 Difference]: With dead ends: 243 [2021-12-15 08:54:51,085 INFO L226 Difference]: Without dead ends: 173 [2021-12-15 08:54:51,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:54:51,086 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 70 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:51,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 161 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:51,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-15 08:54:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 97. [2021-12-15 08:54:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 96 states have internal predecessors, (142), 0 states have call successors, (0), 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-12-15 08:54:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2021-12-15 08:54:51,092 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 25 [2021-12-15 08:54:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:51,092 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2021-12-15 08:54:51,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2021-12-15 08:54:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 08:54:51,093 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:51,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:51,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:51,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:51,320 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:51,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2021-12-15 08:54:51,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:51,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200623483] [2021-12-15 08:54:51,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:51,322 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:51,326 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:51,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-15 08:54:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:51,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 08:54:51,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 08:54:51,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:51,382 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:51,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200623483] [2021-12-15 08:54:51,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200623483] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:51,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:51,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 08:54:51,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720161] [2021-12-15 08:54:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:51,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 08:54:51,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 08:54:51,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:54:51,384 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:51,388 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2021-12-15 08:54:51,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 08:54:51,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 08:54:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:51,389 INFO L225 Difference]: With dead ends: 169 [2021-12-15 08:54:51,389 INFO L226 Difference]: Without dead ends: 85 [2021-12-15 08:54:51,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:54:51,390 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:51,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:54:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-15 08:54:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-12-15 08:54:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 0 states have call successors, (0), 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-12-15 08:54:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2021-12-15 08:54:51,394 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 26 [2021-12-15 08:54:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:51,395 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2021-12-15 08:54:51,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2021-12-15 08:54:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 08:54:51,396 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:51,396 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:51,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:51,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:51,602 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:51,603 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2021-12-15 08:54:51,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:51,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663962174] [2021-12-15 08:54:51,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:51,603 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:51,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:51,604 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:51,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-15 08:54:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:51,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 08:54:51,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:51,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:51,693 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:51,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663962174] [2021-12-15 08:54:51,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663962174] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:51,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:51,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 08:54:51,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688856190] [2021-12-15 08:54:51,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:51,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 08:54:51,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:51,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 08:54:51,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:54:51,695 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:51,703 INFO L93 Difference]: Finished difference Result 119 states and 170 transitions. [2021-12-15 08:54:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 08:54:51,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 08:54:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:51,704 INFO L225 Difference]: With dead ends: 119 [2021-12-15 08:54:51,705 INFO L226 Difference]: Without dead ends: 105 [2021-12-15 08:54:51,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 08:54:51,705 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:51,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:54:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-15 08:54:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-12-15 08:54:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.4423076923076923) internal successors, (150), 104 states have internal predecessors, (150), 0 states have call successors, (0), 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-12-15 08:54:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2021-12-15 08:54:51,710 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 29 [2021-12-15 08:54:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:51,711 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2021-12-15 08:54:51,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2021-12-15 08:54:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 08:54:51,712 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:51,712 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:51,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:51,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:51,919 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:51,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash 480147646, now seen corresponding path program 1 times [2021-12-15 08:54:51,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:51,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162805876] [2021-12-15 08:54:51,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:51,920 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:51,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:51,921 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:51,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-15 08:54:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:51,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 08:54:51,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:52,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:52,070 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:52,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162805876] [2021-12-15 08:54:52,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162805876] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:52,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:52,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 08:54:52,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051971226] [2021-12-15 08:54:52,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:52,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 08:54:52,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:52,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 08:54:52,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 08:54:52,072 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:52,128 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2021-12-15 08:54:52,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 08:54:52,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 08:54:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:52,129 INFO L225 Difference]: With dead ends: 182 [2021-12-15 08:54:52,130 INFO L226 Difference]: Without dead ends: 168 [2021-12-15 08:54:52,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 08:54:52,130 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:52,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 115 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2021-12-15 08:54:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-15 08:54:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 145. [2021-12-15 08:54:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 144 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-12-15 08:54:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2021-12-15 08:54:52,136 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 29 [2021-12-15 08:54:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:52,136 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2021-12-15 08:54:52,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2021-12-15 08:54:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 08:54:52,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:52,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:52,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:52,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:52,344 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:52,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1828261773, now seen corresponding path program 1 times [2021-12-15 08:54:52,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:52,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780914100] [2021-12-15 08:54:52,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:52,345 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:52,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:52,346 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:52,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-15 08:54:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:52,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 08:54:52,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:52,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 08:54:52,475 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:52,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780914100] [2021-12-15 08:54:52,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780914100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:54:52,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:54:52,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 08:54:52,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524537178] [2021-12-15 08:54:52,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:54:52,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 08:54:52,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:52,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 08:54:52,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 08:54:52,477 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:52,547 INFO L93 Difference]: Finished difference Result 236 states and 336 transitions. [2021-12-15 08:54:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 08:54:52,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-15 08:54:52,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:52,548 INFO L225 Difference]: With dead ends: 236 [2021-12-15 08:54:52,548 INFO L226 Difference]: Without dead ends: 222 [2021-12-15 08:54:52,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 08:54:52,549 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 110 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:52,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 220 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2021-12-15 08:54:52,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-12-15 08:54:52,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 145. [2021-12-15 08:54:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 144 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-12-15 08:54:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2021-12-15 08:54:52,554 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 30 [2021-12-15 08:54:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:52,554 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2021-12-15 08:54:52,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:54:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2021-12-15 08:54:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 08:54:52,555 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:52,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:52,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:52,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:52,762 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:52,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:52,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1502060971, now seen corresponding path program 1 times [2021-12-15 08:54:52,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:52,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362918936] [2021-12-15 08:54:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:52,763 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:52,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:52,763 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:52,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-15 08:54:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:52,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 08:54:52,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:52,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:52,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:54:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:52,958 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:52,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362918936] [2021-12-15 08:54:52,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362918936] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:54:52,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:54:52,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-15 08:54:52,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25640209] [2021-12-15 08:54:52,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:54:52,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 08:54:52,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:52,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 08:54:52,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-15 08:54:52,959 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-15 08:54:53,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:53,479 INFO L93 Difference]: Finished difference Result 441 states and 682 transitions. [2021-12-15 08:54:53,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 08:54:53,479 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 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 31 [2021-12-15 08:54:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:53,480 INFO L225 Difference]: With dead ends: 441 [2021-12-15 08:54:53,480 INFO L226 Difference]: Without dead ends: 351 [2021-12-15 08:54:53,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-12-15 08:54:53,481 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 756 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:53,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [756 Valid, 388 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-15 08:54:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-12-15 08:54:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 296. [2021-12-15 08:54:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.4847457627118643) internal successors, (438), 295 states have internal predecessors, (438), 0 states have call successors, (0), 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-12-15 08:54:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 438 transitions. [2021-12-15 08:54:53,488 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 438 transitions. Word has length 31 [2021-12-15 08:54:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:53,488 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 438 transitions. [2021-12-15 08:54:53,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-15 08:54:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 438 transitions. [2021-12-15 08:54:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 08:54:53,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:53,488 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:53,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:53,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:53,695 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1642609581, now seen corresponding path program 1 times [2021-12-15 08:54:53,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:53,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512852810] [2021-12-15 08:54:53,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:53,695 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:53,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:53,696 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:53,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-15 08:54:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:53,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 08:54:53,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:53,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:54:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:53,880 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:53,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512852810] [2021-12-15 08:54:53,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512852810] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:54:53,880 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:54:53,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-15 08:54:53,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492283791] [2021-12-15 08:54:53,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:54:53,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 08:54:53,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:53,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 08:54:53,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-15 08:54:53,881 INFO L87 Difference]: Start difference. First operand 296 states and 438 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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-12-15 08:54:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:54,050 INFO L93 Difference]: Finished difference Result 845 states and 1313 transitions. [2021-12-15 08:54:54,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 08:54:54,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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 31 [2021-12-15 08:54:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:54,052 INFO L225 Difference]: With dead ends: 845 [2021-12-15 08:54:54,052 INFO L226 Difference]: Without dead ends: 571 [2021-12-15 08:54:54,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-15 08:54:54,053 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 429 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:54,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 56 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-12-15 08:54:54,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 436. [2021-12-15 08:54:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.4735632183908045) internal successors, (641), 435 states have internal predecessors, (641), 0 states have call successors, (0), 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-12-15 08:54:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 641 transitions. [2021-12-15 08:54:54,064 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 641 transitions. Word has length 31 [2021-12-15 08:54:54,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:54,065 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 641 transitions. [2021-12-15 08:54:54,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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-12-15 08:54:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 641 transitions. [2021-12-15 08:54:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 08:54:54,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:54,066 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:54,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:54,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:54,272 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:54,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1493994486, now seen corresponding path program 1 times [2021-12-15 08:54:54,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:54,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24333950] [2021-12-15 08:54:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:54:54,273 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:54,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:54,274 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:54,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-15 08:54:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:54:54,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 08:54:54,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-15 08:54:54,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:54:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-15 08:54:54,562 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:54,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24333950] [2021-12-15 08:54:54,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24333950] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:54:54,563 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:54:54,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-15 08:54:54,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683282760] [2021-12-15 08:54:54,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:54:54,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 08:54:54,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:54,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 08:54:54,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-15 08:54:54,564 INFO L87 Difference]: Start difference. First operand 436 states and 641 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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-12-15 08:54:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:54,746 INFO L93 Difference]: Finished difference Result 1371 states and 1978 transitions. [2021-12-15 08:54:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 08:54:54,747 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 70 [2021-12-15 08:54:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:54,749 INFO L225 Difference]: With dead ends: 1371 [2021-12-15 08:54:54,749 INFO L226 Difference]: Without dead ends: 958 [2021-12-15 08:54:54,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-12-15 08:54:54,751 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 288 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:54,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 353 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-12-15 08:54:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 599. [2021-12-15 08:54:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.4866220735785953) internal successors, (889), 598 states have internal predecessors, (889), 0 states have call successors, (0), 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-12-15 08:54:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 889 transitions. [2021-12-15 08:54:54,771 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 889 transitions. Word has length 70 [2021-12-15 08:54:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:54,772 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 889 transitions. [2021-12-15 08:54:54,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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-12-15 08:54:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 889 transitions. [2021-12-15 08:54:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 08:54:54,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:54,773 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2021-12-15 08:54:54,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-15 08:54:54,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:54,979 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:54,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash 464635188, now seen corresponding path program 2 times [2021-12-15 08:54:54,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:54,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488407310] [2021-12-15 08:54:54,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:54:54,980 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:54,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:54,981 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:54,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-15 08:54:55,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:54:55,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:54:55,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 08:54:55,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 08:54:55,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:54:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 08:54:55,281 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:54:55,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488407310] [2021-12-15 08:54:55,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488407310] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:54:55,281 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:54:55,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-12-15 08:54:55,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073238083] [2021-12-15 08:54:55,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:54:55,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 08:54:55,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:54:55,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 08:54:55,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-15 08:54:55,283 INFO L87 Difference]: Start difference. First operand 599 states and 889 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-12-15 08:54:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:54:55,431 INFO L93 Difference]: Finished difference Result 1536 states and 2181 transitions. [2021-12-15 08:54:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 08:54:55,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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 70 [2021-12-15 08:54:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:54:55,434 INFO L225 Difference]: With dead ends: 1536 [2021-12-15 08:54:55,434 INFO L226 Difference]: Without dead ends: 960 [2021-12-15 08:54:55,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-12-15 08:54:55,435 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 231 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:54:55,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 333 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:54:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-12-15 08:54:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 540. [2021-12-15 08:54:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.4267161410018554) internal successors, (769), 539 states have internal predecessors, (769), 0 states have call successors, (0), 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-12-15 08:54:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 769 transitions. [2021-12-15 08:54:55,450 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 769 transitions. Word has length 70 [2021-12-15 08:54:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:54:55,450 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 769 transitions. [2021-12-15 08:54:55,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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-12-15 08:54:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 769 transitions. [2021-12-15 08:54:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 08:54:55,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:54:55,451 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:54:55,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-15 08:54:55,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:54:55,658 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:54:55,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:54:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash 605183798, now seen corresponding path program 3 times [2021-12-15 08:54:55,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:54:55,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106332055] [2021-12-15 08:54:55,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 08:54:55,659 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:54:55,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:54:55,660 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:54:55,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-15 08:54:55,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-15 08:54:55,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:54:55,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-15 08:54:55,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:54:58,058 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:54:58,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:55:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:00,118 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:55:00,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106332055] [2021-12-15 08:55:00,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106332055] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:55:00,119 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:55:00,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2021-12-15 08:55:00,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265450009] [2021-12-15 08:55:00,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:55:00,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-15 08:55:00,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:55:00,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-15 08:55:00,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2021-12-15 08:55:00,126 INFO L87 Difference]: Start difference. First operand 540 states and 769 transitions. Second operand has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 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-12-15 08:55:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:55:14,401 INFO L93 Difference]: Finished difference Result 1707 states and 2292 transitions. [2021-12-15 08:55:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2021-12-15 08:55:14,402 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 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 70 [2021-12-15 08:55:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:55:14,405 INFO L225 Difference]: With dead ends: 1707 [2021-12-15 08:55:14,406 INFO L226 Difference]: Without dead ends: 1599 [2021-12-15 08:55:14,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4293 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=3281, Invalid=16179, Unknown=0, NotChecked=0, Total=19460 [2021-12-15 08:55:14,410 INFO L933 BasicCegarLoop]: 447 mSDtfsCounter, 2598 mSDsluCounter, 9669 mSDsCounter, 0 mSdLazyCounter, 5991 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2598 SdHoareTripleChecker+Valid, 10116 SdHoareTripleChecker+Invalid, 6366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 5991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-12-15 08:55:14,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2598 Valid, 10116 Invalid, 6366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 5991 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2021-12-15 08:55:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2021-12-15 08:55:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 895. [2021-12-15 08:55:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 1.4407158836689038) internal successors, (1288), 894 states have internal predecessors, (1288), 0 states have call successors, (0), 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-12-15 08:55:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1288 transitions. [2021-12-15 08:55:14,437 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1288 transitions. Word has length 70 [2021-12-15 08:55:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:55:14,438 INFO L470 AbstractCegarLoop]: Abstraction has 895 states and 1288 transitions. [2021-12-15 08:55:14,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 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-12-15 08:55:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1288 transitions. [2021-12-15 08:55:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 08:55:14,439 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:55:14,439 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:55:14,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-15 08:55:14,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:55:14,646 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:55:14,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:55:14,647 INFO L85 PathProgramCache]: Analyzing trace with hash 824038516, now seen corresponding path program 1 times [2021-12-15 08:55:14,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:55:14,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87833310] [2021-12-15 08:55:14,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:55:14,648 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:55:14,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:55:14,648 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:55:14,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-15 08:55:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:55:14,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 08:55:14,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:55:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 08:55:14,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:55:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 08:55:14,975 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:55:14,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87833310] [2021-12-15 08:55:14,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87833310] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:55:14,976 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:55:14,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-12-15 08:55:14,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871932216] [2021-12-15 08:55:14,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:55:14,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 08:55:14,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:55:14,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 08:55:14,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:55:14,977 INFO L87 Difference]: Start difference. First operand 895 states and 1288 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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-12-15 08:55:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:55:15,112 INFO L93 Difference]: Finished difference Result 1832 states and 2644 transitions. [2021-12-15 08:55:15,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 08:55:15,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 70 [2021-12-15 08:55:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:55:15,115 INFO L225 Difference]: With dead ends: 1832 [2021-12-15 08:55:15,115 INFO L226 Difference]: Without dead ends: 957 [2021-12-15 08:55:15,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 08:55:15,117 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 38 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:55:15,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 84 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:55:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-12-15 08:55:15,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 777. [2021-12-15 08:55:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 776 states have (on average 1.402061855670103) internal successors, (1088), 776 states have internal predecessors, (1088), 0 states have call successors, (0), 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-12-15 08:55:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1088 transitions. [2021-12-15 08:55:15,137 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1088 transitions. Word has length 70 [2021-12-15 08:55:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:55:15,138 INFO L470 AbstractCegarLoop]: Abstraction has 777 states and 1088 transitions. [2021-12-15 08:55:15,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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-12-15 08:55:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1088 transitions. [2021-12-15 08:55:15,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-15 08:55:15,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:55:15,139 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:55:15,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-15 08:55:15,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 08:55:15,345 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:55:15,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:55:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1235371034, now seen corresponding path program 1 times [2021-12-15 08:55:15,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 08:55:15,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350280719] [2021-12-15 08:55:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:55:15,346 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 08:55:15,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 08:55:15,347 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 08:55:15,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-15 08:55:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:55:15,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-15 08:55:15,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:55:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:17,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:55:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:55:20,381 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 08:55:20,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350280719] [2021-12-15 08:55:20,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350280719] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:55:20,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:55:20,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2021-12-15 08:55:20,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390348978] [2021-12-15 08:55:20,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:55:20,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-15 08:55:20,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 08:55:20,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-15 08:55:20,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2021-12-15 08:55:20,383 INFO L87 Difference]: Start difference. First operand 777 states and 1088 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)