./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:26:38,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:26:38,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:26:38,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:26:38,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:26:38,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:26:38,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:26:38,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:26:38,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:26:38,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:26:38,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:26:38,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:26:38,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:26:38,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:26:38,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:26:38,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:26:38,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:26:38,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:26:38,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:26:38,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:26:38,302 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:26:38,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:26:38,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:26:38,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:26:38,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:26:38,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:26:38,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:26:38,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:26:38,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:26:38,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:26:38,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:26:38,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:26:38,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:26:38,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:26:38,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:26:38,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:26:38,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:26:38,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:26:38,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:26:38,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:26:38,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:26:38,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:26:38,319 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:26:38,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:26:38,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:26:38,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:26:38,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:26:38,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:26:38,341 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:26:38,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:26:38,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:26:38,341 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:26:38,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:26:38,342 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:26:38,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:26:38,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:26:38,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:26:38,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:26:38,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:26:38,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:26:38,343 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:26:38,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:26:38,343 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:26:38,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:26:38,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:26:38,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:26:38,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:26:38,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:26:38,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:26:38,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:26:38,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:26:38,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:26:38,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:26:38,344 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:26:38,345 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:26:38,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:26:38,345 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2022-07-13 11:26:38,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:26:38,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:26:38,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:26:38,541 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:26:38,541 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:26:38,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-13 11:26:38,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde2ade2a/773fdd5a72b0407a875a372bc7f4c9b5/FLAGd1cd04d84 [2022-07-13 11:26:38,986 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:26:38,987 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-13 11:26:38,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde2ade2a/773fdd5a72b0407a875a372bc7f4c9b5/FLAGd1cd04d84 [2022-07-13 11:26:39,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde2ade2a/773fdd5a72b0407a875a372bc7f4c9b5 [2022-07-13 11:26:39,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:26:39,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:26:39,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:26:39,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:26:39,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:26:39,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:26:39" (1/1) ... [2022-07-13 11:26:39,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103d83d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39, skipping insertion in model container [2022-07-13 11:26:39,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:26:39" (1/1) ... [2022-07-13 11:26:39,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:26:39,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:26:39,141 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/soft_float_4-3a.c.cil.c[730,743] [2022-07-13 11:26:39,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:26:39,216 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:26:39,224 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/soft_float_4-3a.c.cil.c[730,743] [2022-07-13 11:26:39,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:26:39,257 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:26:39,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39 WrapperNode [2022-07-13 11:26:39,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:26:39,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:26:39,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:26:39,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:26:39,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39" (1/1) ... [2022-07-13 11:26:39,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39" (1/1) ... [2022-07-13 11:26:39,286 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-07-13 11:26:39,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:26:39,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:26:39,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:26:39,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:26:39,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39" (1/1) ... [2022-07-13 11:26:39,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39" (1/1) ... [2022-07-13 11:26:39,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39" (1/1) ... [2022-07-13 11:26:39,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39" (1/1) ... [2022-07-13 11:26:39,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39" (1/1) ... [2022-07-13 11:26:39,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39" (1/1) ... [2022-07-13 11:26:39,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39" (1/1) ... [2022-07-13 11:26:39,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:26:39,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:26:39,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:26:39,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:26:39,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39" (1/1) ... [2022-07-13 11:26:39,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:26:39,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:39,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:26:39,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:26:39,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:26:39,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:26:39,388 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-13 11:26:39,388 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-13 11:26:39,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:26:39,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:26:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-13 11:26:39,392 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-13 11:26:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 11:26:39,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 11:26:39,478 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:26:39,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:26:39,772 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:26:39,776 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:26:39,777 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 11:26:39,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:26:39 BoogieIcfgContainer [2022-07-13 11:26:39,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:26:39,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:26:39,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:26:39,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:26:39,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:26:39" (1/3) ... [2022-07-13 11:26:39,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23902aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:26:39, skipping insertion in model container [2022-07-13 11:26:39,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:39" (2/3) ... [2022-07-13 11:26:39,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23902aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:26:39, skipping insertion in model container [2022-07-13 11:26:39,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:26:39" (3/3) ... [2022-07-13 11:26:39,804 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-07-13 11:26:39,813 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:26:39,813 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:26:39,850 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:26:39,855 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a7875c6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ff40416 [2022-07-13 11:26:39,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:26:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 74 states have (on average 1.6891891891891893) internal successors, (125), 75 states have internal predecessors, (125), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-13 11:26:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:26:39,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:39,867 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:26:39,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:39,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash 176765495, now seen corresponding path program 1 times [2022-07-13 11:26:39,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:39,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891601182] [2022-07-13 11:26:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:39,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:40,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:40,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:40,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:40,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:40,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891601182] [2022-07-13 11:26:40,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891601182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:40,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:40,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:26:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430139078] [2022-07-13 11:26:40,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:40,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:26:40,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:40,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:26:40,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:26:40,125 INFO L87 Difference]: Start difference. First operand has 88 states, 74 states have (on average 1.6891891891891893) internal successors, (125), 75 states have internal predecessors, (125), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:40,212 INFO L93 Difference]: Finished difference Result 181 states and 305 transitions. [2022-07-13 11:26:40,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:26:40,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-07-13 11:26:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:40,223 INFO L225 Difference]: With dead ends: 181 [2022-07-13 11:26:40,224 INFO L226 Difference]: Without dead ends: 92 [2022-07-13 11:26:40,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:26:40,238 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 90 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:40,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 147 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-13 11:26:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2022-07-13 11:26:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 11:26:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2022-07-13 11:26:40,333 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 37 [2022-07-13 11:26:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:40,334 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2022-07-13 11:26:40,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2022-07-13 11:26:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:26:40,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:40,338 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-07-13 11:26:40,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:26:40,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:40,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1174822094, now seen corresponding path program 1 times [2022-07-13 11:26:40,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:40,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013267342] [2022-07-13 11:26:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:40,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:40,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:40,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:40,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:40,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:26:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:40,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 11:26:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:26:40,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:40,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013267342] [2022-07-13 11:26:40,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013267342] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:40,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707509801] [2022-07-13 11:26:40,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:40,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:40,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:40,667 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:40,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:26:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:40,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 11:26:40,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:26:40,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:26:41,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707509801] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:41,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:41,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 24 [2022-07-13 11:26:41,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076780102] [2022-07-13 11:26:41,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:41,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 11:26:41,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:41,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 11:26:41,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2022-07-13 11:26:41,042 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 24 states, 20 states have (on average 2.6) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-13 11:26:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:43,306 INFO L93 Difference]: Finished difference Result 419 states and 669 transitions. [2022-07-13 11:26:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 11:26:43,307 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.6) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 44 [2022-07-13 11:26:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:43,311 INFO L225 Difference]: With dead ends: 419 [2022-07-13 11:26:43,312 INFO L226 Difference]: Without dead ends: 338 [2022-07-13 11:26:43,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1562, Unknown=0, NotChecked=0, Total=1806 [2022-07-13 11:26:43,315 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 987 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4133 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 4312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 4133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:43,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 553 Invalid, 4312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 4133 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-13 11:26:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-13 11:26:43,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 116. [2022-07-13 11:26:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 98 states have internal predecessors, (132), 14 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (22), 13 states have call predecessors, (22), 13 states have call successors, (22) [2022-07-13 11:26:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2022-07-13 11:26:43,365 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 44 [2022-07-13 11:26:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:43,366 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2022-07-13 11:26:43,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.6) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-13 11:26:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2022-07-13 11:26:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:26:43,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:43,371 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-07-13 11:26:43,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 11:26:43,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:43,572 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1191712414, now seen corresponding path program 1 times [2022-07-13 11:26:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:43,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540739853] [2022-07-13 11:26:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:43,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:43,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:43,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:43,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540739853] [2022-07-13 11:26:43,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540739853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:43,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:43,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:26:43,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514385476] [2022-07-13 11:26:43,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:43,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:43,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:43,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:43,646 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:43,730 INFO L93 Difference]: Finished difference Result 212 states and 306 transitions. [2022-07-13 11:26:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:26:43,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-13 11:26:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:43,732 INFO L225 Difference]: With dead ends: 212 [2022-07-13 11:26:43,732 INFO L226 Difference]: Without dead ends: 132 [2022-07-13 11:26:43,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:43,734 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 112 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:43,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 192 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-13 11:26:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 117. [2022-07-13 11:26:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 99 states have internal predecessors, (131), 14 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (22), 13 states have call predecessors, (22), 13 states have call successors, (22) [2022-07-13 11:26:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2022-07-13 11:26:43,746 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 43 [2022-07-13 11:26:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:43,747 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2022-07-13 11:26:43,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2022-07-13 11:26:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:26:43,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:43,749 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-07-13 11:26:43,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:26:43,749 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:43,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:43,750 INFO L85 PathProgramCache]: Analyzing trace with hash 186942930, now seen corresponding path program 1 times [2022-07-13 11:26:43,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:43,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095032477] [2022-07-13 11:26:43,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:43,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:43,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:43,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:43,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:26:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 11:26:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:26:43,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:43,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095032477] [2022-07-13 11:26:43,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095032477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:43,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:43,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-13 11:26:43,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661409105] [2022-07-13 11:26:43,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:43,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:26:43,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:43,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:26:43,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:26:43,958 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-13 11:26:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:45,251 INFO L93 Difference]: Finished difference Result 250 states and 362 transitions. [2022-07-13 11:26:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 11:26:45,252 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2022-07-13 11:26:45,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:45,256 INFO L225 Difference]: With dead ends: 250 [2022-07-13 11:26:45,256 INFO L226 Difference]: Without dead ends: 242 [2022-07-13 11:26:45,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-07-13 11:26:45,262 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 288 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:45,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 462 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 11:26:45,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-13 11:26:45,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 122. [2022-07-13 11:26:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.35) internal successors, (135), 102 states have internal predecessors, (135), 15 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (23), 15 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-13 11:26:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 173 transitions. [2022-07-13 11:26:45,286 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 173 transitions. Word has length 44 [2022-07-13 11:26:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:45,287 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 173 transitions. [2022-07-13 11:26:45,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-13 11:26:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 173 transitions. [2022-07-13 11:26:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 11:26:45,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:45,294 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-07-13 11:26:45,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:26:45,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash -407484938, now seen corresponding path program 1 times [2022-07-13 11:26:45,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:45,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809061252] [2022-07-13 11:26:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:45,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:45,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:45,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:45,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:26:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:45,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 11:26:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 11:26:45,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:45,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809061252] [2022-07-13 11:26:45,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809061252] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:45,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:45,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:26:45,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891173313] [2022-07-13 11:26:45,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:45,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:26:45,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:45,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:26:45,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:26:45,379 INFO L87 Difference]: Start difference. First operand 122 states and 173 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 11:26:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:45,711 INFO L93 Difference]: Finished difference Result 179 states and 253 transitions. [2022-07-13 11:26:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:26:45,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-07-13 11:26:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:45,714 INFO L225 Difference]: With dead ends: 179 [2022-07-13 11:26:45,714 INFO L226 Difference]: Without dead ends: 168 [2022-07-13 11:26:45,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:26:45,716 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 201 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:45,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 239 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:26:45,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-13 11:26:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2022-07-13 11:26:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 100 states have internal predecessors, (131), 15 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (22), 14 states have call predecessors, (22), 13 states have call successors, (22) [2022-07-13 11:26:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2022-07-13 11:26:45,735 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 46 [2022-07-13 11:26:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:45,735 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2022-07-13 11:26:45,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 11:26:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2022-07-13 11:26:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 11:26:45,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:45,737 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:45,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:26:45,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:45,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:45,738 INFO L85 PathProgramCache]: Analyzing trace with hash -167909170, now seen corresponding path program 1 times [2022-07-13 11:26:45,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:45,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328427490] [2022-07-13 11:26:45,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:45,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:45,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:45,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:45,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:26:45,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:45,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328427490] [2022-07-13 11:26:45,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328427490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:45,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:45,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 11:26:45,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523085785] [2022-07-13 11:26:45,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:45,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:26:45,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:45,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:26:45,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:26:45,823 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:46,119 INFO L93 Difference]: Finished difference Result 222 states and 313 transitions. [2022-07-13 11:26:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:26:46,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-07-13 11:26:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:46,121 INFO L225 Difference]: With dead ends: 222 [2022-07-13 11:26:46,121 INFO L226 Difference]: Without dead ends: 166 [2022-07-13 11:26:46,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:26:46,122 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 171 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:46,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 474 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:26:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-13 11:26:46,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2022-07-13 11:26:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 105 states have internal predecessors, (136), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (22), 14 states have call predecessors, (22), 13 states have call successors, (22) [2022-07-13 11:26:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2022-07-13 11:26:46,129 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 46 [2022-07-13 11:26:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:46,130 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2022-07-13 11:26:46,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:26:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2022-07-13 11:26:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:26:46,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:46,131 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:46,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:26:46,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:46,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:46,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1626225281, now seen corresponding path program 1 times [2022-07-13 11:26:46,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:46,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964348853] [2022-07-13 11:26:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:46,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:46,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:46,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:46,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 11:26:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:46,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 11:26:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:26:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964348853] [2022-07-13 11:26:46,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964348853] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275681073] [2022-07-13 11:26:46,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:46,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:46,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:46,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:46,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:26:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:46,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-13 11:26:46,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:26:46,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:26:46,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275681073] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:46,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:46,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 34 [2022-07-13 11:26:46,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226912257] [2022-07-13 11:26:46,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:46,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-13 11:26:46,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:46,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-13 11:26:46,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 11:26:46,877 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand has 34 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 25 states have internal predecessors, (53), 6 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 11:26:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:52,203 INFO L93 Difference]: Finished difference Result 483 states and 769 transitions. [2022-07-13 11:26:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-13 11:26:52,204 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 25 states have internal predecessors, (53), 6 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2022-07-13 11:26:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:52,206 INFO L225 Difference]: With dead ends: 483 [2022-07-13 11:26:52,207 INFO L226 Difference]: Without dead ends: 472 [2022-07-13 11:26:52,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=739, Invalid=6233, Unknown=0, NotChecked=0, Total=6972 [2022-07-13 11:26:52,211 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 797 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 8894 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 9161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 8894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:52,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 739 Invalid, 9161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 8894 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-13 11:26:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-13 11:26:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 164. [2022-07-13 11:26:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 135 states have internal predecessors, (166), 23 states have call successors, (23), 5 states have call predecessors, (23), 11 states have return successors, (60), 23 states have call predecessors, (60), 21 states have call successors, (60) [2022-07-13 11:26:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2022-07-13 11:26:52,236 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 48 [2022-07-13 11:26:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:52,236 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2022-07-13 11:26:52,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 25 states have internal predecessors, (53), 6 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 11:26:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2022-07-13 11:26:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:26:52,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:52,238 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:52,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:52,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-13 11:26:52,454 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:52,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash 976965441, now seen corresponding path program 2 times [2022-07-13 11:26:52,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:52,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396380734] [2022-07-13 11:26:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:52,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:52,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:52,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:52,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 11:26:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:52,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 11:26:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:26:52,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:52,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396380734] [2022-07-13 11:26:52,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396380734] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:52,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471354844] [2022-07-13 11:26:52,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:26:52,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:52,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:52,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:52,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:26:52,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:26:52,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:26:52,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 11:26:52,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:26:52,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:26:53,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471354844] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:53,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:53,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-07-13 11:26:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091388184] [2022-07-13 11:26:53,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:53,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-13 11:26:53,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:53,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-13 11:26:53,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2022-07-13 11:26:53,078 INFO L87 Difference]: Start difference. First operand 164 states and 249 transitions. Second operand has 30 states, 29 states have (on average 2.0) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-13 11:26:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:55,710 INFO L93 Difference]: Finished difference Result 348 states and 670 transitions. [2022-07-13 11:26:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 11:26:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) Word has length 48 [2022-07-13 11:26:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:55,713 INFO L225 Difference]: With dead ends: 348 [2022-07-13 11:26:55,713 INFO L226 Difference]: Without dead ends: 341 [2022-07-13 11:26:55,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=378, Invalid=3282, Unknown=0, NotChecked=0, Total=3660 [2022-07-13 11:26:55,714 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 809 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 4614 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 4828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 4614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:55,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 498 Invalid, 4828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 4614 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-13 11:26:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-13 11:26:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 172. [2022-07-13 11:26:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 139 states have internal predecessors, (170), 27 states have call successors, (27), 5 states have call predecessors, (27), 11 states have return successors, (75), 27 states have call predecessors, (75), 25 states have call successors, (75) [2022-07-13 11:26:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 272 transitions. [2022-07-13 11:26:55,733 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 272 transitions. Word has length 48 [2022-07-13 11:26:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:55,733 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 272 transitions. [2022-07-13 11:26:55,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-13 11:26:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 272 transitions. [2022-07-13 11:26:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 11:26:55,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:55,734 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-07-13 11:26:55,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:55,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:55,951 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:55,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1260029991, now seen corresponding path program 1 times [2022-07-13 11:26:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:55,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23318619] [2022-07-13 11:26:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:55,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:55,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:55,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:56,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 11:26:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:56,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 11:26:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:26:56,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:56,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23318619] [2022-07-13 11:26:56,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23318619] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:56,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256548082] [2022-07-13 11:26:56,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:56,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:56,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:56,080 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:26:56,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:26:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:56,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 11:26:56,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:26:56,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:26:56,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256548082] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:56,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:56,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 24 [2022-07-13 11:26:56,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72188247] [2022-07-13 11:26:56,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:56,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 11:26:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:56,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 11:26:56,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-13 11:26:56,438 INFO L87 Difference]: Start difference. First operand 172 states and 272 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 11:26:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:58,243 INFO L93 Difference]: Finished difference Result 342 states and 591 transitions. [2022-07-13 11:26:58,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 11:26:58,244 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 50 [2022-07-13 11:26:58,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:58,245 INFO L225 Difference]: With dead ends: 342 [2022-07-13 11:26:58,246 INFO L226 Difference]: Without dead ends: 331 [2022-07-13 11:26:58,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2022-07-13 11:26:58,247 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 425 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 3749 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 3825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 3749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:58,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 463 Invalid, 3825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 3749 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 11:26:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-13 11:26:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 172. [2022-07-13 11:26:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 139 states have internal predecessors, (170), 27 states have call successors, (27), 5 states have call predecessors, (27), 11 states have return successors, (75), 27 states have call predecessors, (75), 25 states have call successors, (75) [2022-07-13 11:26:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 272 transitions. [2022-07-13 11:26:58,262 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 272 transitions. Word has length 50 [2022-07-13 11:26:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:58,262 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 272 transitions. [2022-07-13 11:26:58,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 11:26:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 272 transitions. [2022-07-13 11:26:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 11:26:58,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:58,263 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:58,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:58,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:58,479 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:58,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:58,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1462321561, now seen corresponding path program 1 times [2022-07-13 11:26:58,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:58,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179243548] [2022-07-13 11:26:58,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:58,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:58,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:58,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:58,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:26:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:58,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 11:26:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:58,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 11:26:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:26:58,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:58,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179243548] [2022-07-13 11:26:58,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179243548] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:58,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994773835] [2022-07-13 11:26:58,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:58,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:58,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:58,673 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) [2022-07-13 11:26:58,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:26:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:58,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 11:26:58,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:26:58,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:26:59,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994773835] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:59,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:59,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 31 [2022-07-13 11:26:59,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729389582] [2022-07-13 11:26:59,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:59,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 11:26:59,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:59,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 11:26:59,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=861, Unknown=0, NotChecked=0, Total=930 [2022-07-13 11:26:59,142 INFO L87 Difference]: Start difference. First operand 172 states and 272 transitions. Second operand has 31 states, 30 states have (on average 2.066666666666667) internal successors, (62), 23 states have internal predecessors, (62), 5 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 9 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 11:27:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:01,931 INFO L93 Difference]: Finished difference Result 343 states and 636 transitions. [2022-07-13 11:27:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-13 11:27:01,931 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.066666666666667) internal successors, (62), 23 states have internal predecessors, (62), 5 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 9 states have call predecessors, (13), 4 states have call successors, (13) Word has length 50 [2022-07-13 11:27:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:01,933 INFO L225 Difference]: With dead ends: 343 [2022-07-13 11:27:01,933 INFO L226 Difference]: Without dead ends: 320 [2022-07-13 11:27:01,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=449, Invalid=4107, Unknown=0, NotChecked=0, Total=4556 [2022-07-13 11:27:01,935 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 792 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 4569 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 4569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:01,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 499 Invalid, 4726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 4569 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-13 11:27:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-13 11:27:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 180. [2022-07-13 11:27:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 138 states have (on average 1.2681159420289856) internal successors, (175), 143 states have internal predecessors, (175), 30 states have call successors, (30), 5 states have call predecessors, (30), 11 states have return successors, (84), 31 states have call predecessors, (84), 28 states have call successors, (84) [2022-07-13 11:27:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 289 transitions. [2022-07-13 11:27:01,952 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 289 transitions. Word has length 50 [2022-07-13 11:27:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:01,953 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 289 transitions. [2022-07-13 11:27:01,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.066666666666667) internal successors, (62), 23 states have internal predecessors, (62), 5 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 9 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 11:27:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 289 transitions. [2022-07-13 11:27:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 11:27:01,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:01,954 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:01,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:02,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 11:27:02,172 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:02,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:02,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1556864061, now seen corresponding path program 1 times [2022-07-13 11:27:02,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:02,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015060315] [2022-07-13 11:27:02,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:02,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:27:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:27:02,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:02,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015060315] [2022-07-13 11:27:02,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015060315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:02,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:02,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:27:02,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303008049] [2022-07-13 11:27:02,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:02,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:27:02,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:27:02,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:27:02,228 INFO L87 Difference]: Start difference. First operand 180 states and 289 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:02,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:02,297 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2022-07-13 11:27:02,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:27:02,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-13 11:27:02,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:02,299 INFO L225 Difference]: With dead ends: 304 [2022-07-13 11:27:02,299 INFO L226 Difference]: Without dead ends: 188 [2022-07-13 11:27:02,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:27:02,301 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:02,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 191 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:27:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-13 11:27:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2022-07-13 11:27:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 143 states have internal predecessors, (174), 30 states have call successors, (30), 5 states have call predecessors, (30), 11 states have return successors, (84), 31 states have call predecessors, (84), 28 states have call successors, (84) [2022-07-13 11:27:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 288 transitions. [2022-07-13 11:27:02,314 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 288 transitions. Word has length 50 [2022-07-13 11:27:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:02,314 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 288 transitions. [2022-07-13 11:27:02,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 288 transitions. [2022-07-13 11:27:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 11:27:02,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:02,315 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:02,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:27:02,315 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:02,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1943903020, now seen corresponding path program 1 times [2022-07-13 11:27:02,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:02,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969715156] [2022-07-13 11:27:02,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:02,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:27:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 11:27:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 11:27:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:27:02,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:02,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969715156] [2022-07-13 11:27:02,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969715156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:02,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:02,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:27:02,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172167057] [2022-07-13 11:27:02,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:02,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:27:02,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:02,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:27:02,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:27:02,355 INFO L87 Difference]: Start difference. First operand 180 states and 288 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 11:27:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:02,558 INFO L93 Difference]: Finished difference Result 426 states and 705 transitions. [2022-07-13 11:27:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:27:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-07-13 11:27:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:02,560 INFO L225 Difference]: With dead ends: 426 [2022-07-13 11:27:02,560 INFO L226 Difference]: Without dead ends: 263 [2022-07-13 11:27:02,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:27:02,562 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 223 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:02,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 183 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:27:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-13 11:27:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 181. [2022-07-13 11:27:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 139 states have (on average 1.2589928057553956) internal successors, (175), 144 states have internal predecessors, (175), 30 states have call successors, (30), 5 states have call predecessors, (30), 11 states have return successors, (84), 31 states have call predecessors, (84), 28 states have call successors, (84) [2022-07-13 11:27:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 289 transitions. [2022-07-13 11:27:02,576 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 289 transitions. Word has length 52 [2022-07-13 11:27:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:02,577 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 289 transitions. [2022-07-13 11:27:02,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 11:27:02,577 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2022-07-13 11:27:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 11:27:02,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:02,578 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:02,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:27:02,579 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:02,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:02,579 INFO L85 PathProgramCache]: Analyzing trace with hash 380344415, now seen corresponding path program 1 times [2022-07-13 11:27:02,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:02,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609419945] [2022-07-13 11:27:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:02,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:27:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 11:27:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 11:27:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:27:02,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:02,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609419945] [2022-07-13 11:27:02,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609419945] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:02,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583220193] [2022-07-13 11:27:02,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:02,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:02,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:02,715 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) [2022-07-13 11:27:02,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 11:27:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:02,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 11:27:02,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:27:02,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:27:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:27:03,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583220193] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:27:03,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:27:03,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2022-07-13 11:27:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606958245] [2022-07-13 11:27:03,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:27:03,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-13 11:27:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:03,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-13 11:27:03,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2022-07-13 11:27:03,158 INFO L87 Difference]: Start difference. First operand 181 states and 289 transitions. Second operand has 36 states, 32 states have (on average 2.21875) internal successors, (71), 28 states have internal predecessors, (71), 6 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-07-13 11:27:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:08,816 INFO L93 Difference]: Finished difference Result 673 states and 1221 transitions. [2022-07-13 11:27:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-13 11:27:08,817 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 2.21875) internal successors, (71), 28 states have internal predecessors, (71), 6 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 53 [2022-07-13 11:27:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:08,820 INFO L225 Difference]: With dead ends: 673 [2022-07-13 11:27:08,820 INFO L226 Difference]: Without dead ends: 553 [2022-07-13 11:27:08,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=836, Invalid=8284, Unknown=0, NotChecked=0, Total=9120 [2022-07-13 11:27:08,823 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 1059 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 10055 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 10356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 10055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:08,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 812 Invalid, 10356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 10055 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-13 11:27:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-07-13 11:27:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 226. [2022-07-13 11:27:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 169 states have (on average 1.2544378698224852) internal successors, (212), 177 states have internal predecessors, (212), 42 states have call successors, (42), 5 states have call predecessors, (42), 14 states have return successors, (155), 43 states have call predecessors, (155), 40 states have call successors, (155) [2022-07-13 11:27:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 409 transitions. [2022-07-13 11:27:08,847 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 409 transitions. Word has length 53 [2022-07-13 11:27:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:08,847 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 409 transitions. [2022-07-13 11:27:08,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 2.21875) internal successors, (71), 28 states have internal predecessors, (71), 6 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-07-13 11:27:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 409 transitions. [2022-07-13 11:27:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 11:27:08,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:08,849 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:08,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:09,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:09,065 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:09,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2040511084, now seen corresponding path program 1 times [2022-07-13 11:27:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:09,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691300422] [2022-07-13 11:27:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:09,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:09,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:09,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:27:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:09,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 11:27:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:09,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 11:27:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:27:09,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:09,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691300422] [2022-07-13 11:27:09,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691300422] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:09,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803458922] [2022-07-13 11:27:09,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:09,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:09,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:09,121 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) [2022-07-13 11:27:09,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 11:27:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:09,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 11:27:09,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:27:09,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:27:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:27:09,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803458922] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:27:09,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:27:09,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 20 [2022-07-13 11:27:09,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756240847] [2022-07-13 11:27:09,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:27:09,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 11:27:09,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:09,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 11:27:09,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:27:09,370 INFO L87 Difference]: Start difference. First operand 226 states and 409 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 11:27:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:11,207 INFO L93 Difference]: Finished difference Result 607 states and 1268 transitions. [2022-07-13 11:27:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 11:27:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 53 [2022-07-13 11:27:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:11,213 INFO L225 Difference]: With dead ends: 607 [2022-07-13 11:27:11,213 INFO L226 Difference]: Without dead ends: 396 [2022-07-13 11:27:11,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 11:27:11,216 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 421 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 3835 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 3927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 3835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:11,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 622 Invalid, 3927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 3835 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 11:27:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-13 11:27:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 257. [2022-07-13 11:27:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 190 states have (on average 1.2421052631578948) internal successors, (236), 199 states have internal predecessors, (236), 51 states have call successors, (51), 5 states have call predecessors, (51), 15 states have return successors, (208), 52 states have call predecessors, (208), 49 states have call successors, (208) [2022-07-13 11:27:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 495 transitions. [2022-07-13 11:27:11,242 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 495 transitions. Word has length 53 [2022-07-13 11:27:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:11,242 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 495 transitions. [2022-07-13 11:27:11,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 11:27:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 495 transitions. [2022-07-13 11:27:11,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 11:27:11,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:11,244 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:11,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:11,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:11,460 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:11,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1827539848, now seen corresponding path program 1 times [2022-07-13 11:27:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:11,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592327570] [2022-07-13 11:27:11,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:11,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:11,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:11,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:27:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:11,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:11,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592327570] [2022-07-13 11:27:11,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592327570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:11,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533666565] [2022-07-13 11:27:11,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:11,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:11,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:11,516 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) [2022-07-13 11:27:11,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 11:27:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:11,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:27:11,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:11,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:27:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:11,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533666565] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:27:11,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:27:11,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-07-13 11:27:11,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420144407] [2022-07-13 11:27:11,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:27:11,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 11:27:11,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:11,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 11:27:11,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:27:11,683 INFO L87 Difference]: Start difference. First operand 257 states and 495 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:27:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:12,290 INFO L93 Difference]: Finished difference Result 612 states and 1350 transitions. [2022-07-13 11:27:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:27:12,290 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2022-07-13 11:27:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:12,295 INFO L225 Difference]: With dead ends: 612 [2022-07-13 11:27:12,295 INFO L226 Difference]: Without dead ends: 495 [2022-07-13 11:27:12,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2022-07-13 11:27:12,298 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 225 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:12,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 863 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:27:12,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-07-13 11:27:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 269. [2022-07-13 11:27:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 201 states have (on average 1.2338308457711442) internal successors, (248), 211 states have internal predecessors, (248), 49 states have call successors, (49), 7 states have call predecessors, (49), 18 states have return successors, (198), 50 states have call predecessors, (198), 47 states have call successors, (198) [2022-07-13 11:27:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 495 transitions. [2022-07-13 11:27:12,346 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 495 transitions. Word has length 53 [2022-07-13 11:27:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:12,346 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 495 transitions. [2022-07-13 11:27:12,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:27:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 495 transitions. [2022-07-13 11:27:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 11:27:12,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:12,349 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:12,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:12,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 11:27:12,565 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:12,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2006096899, now seen corresponding path program 1 times [2022-07-13 11:27:12,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:12,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774688664] [2022-07-13 11:27:12,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:12,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:12,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:12,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:12,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 11:27:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 11:27:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:12,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 11:27:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 11:27:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:12,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774688664] [2022-07-13 11:27:12,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774688664] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:12,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671691623] [2022-07-13 11:27:12,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:12,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:12,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:12,602 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:27:12,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 11:27:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:12,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:27:12,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:27:12,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:27:12,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671691623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:12,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:27:12,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-13 11:27:12,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332494379] [2022-07-13 11:27:12,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:12,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:27:12,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:12,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:27:12,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:27:12,660 INFO L87 Difference]: Start difference. First operand 269 states and 495 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 11:27:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:12,708 INFO L93 Difference]: Finished difference Result 496 states and 887 transitions. [2022-07-13 11:27:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:27:12,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-07-13 11:27:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:12,710 INFO L225 Difference]: With dead ends: 496 [2022-07-13 11:27:12,710 INFO L226 Difference]: Without dead ends: 276 [2022-07-13 11:27:12,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:27:12,712 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 14 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:12,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 337 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:27:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-13 11:27:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2022-07-13 11:27:12,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 202 states have (on average 1.2376237623762376) internal successors, (250), 212 states have internal predecessors, (250), 49 states have call successors, (49), 7 states have call predecessors, (49), 18 states have return successors, (198), 50 states have call predecessors, (198), 47 states have call successors, (198) [2022-07-13 11:27:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 497 transitions. [2022-07-13 11:27:12,734 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 497 transitions. Word has length 54 [2022-07-13 11:27:12,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:12,734 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 497 transitions. [2022-07-13 11:27:12,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 11:27:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 497 transitions. [2022-07-13 11:27:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 11:27:12,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:12,736 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:12,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:12,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 11:27:12,952 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:12,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:12,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1697379934, now seen corresponding path program 1 times [2022-07-13 11:27:12,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:12,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117440111] [2022-07-13 11:27:12,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:12,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:13,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:13,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:13,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 11:27:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:13,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:27:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:13,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 11:27:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:27:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:13,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117440111] [2022-07-13 11:27:13,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117440111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:13,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:13,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-13 11:27:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733820855] [2022-07-13 11:27:13,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:13,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 11:27:13,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:13,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 11:27:13,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:27:13,196 INFO L87 Difference]: Start difference. First operand 270 states and 497 transitions. Second operand has 18 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:27:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:14,498 INFO L93 Difference]: Finished difference Result 399 states and 828 transitions. [2022-07-13 11:27:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 11:27:14,499 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-07-13 11:27:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:14,501 INFO L225 Difference]: With dead ends: 399 [2022-07-13 11:27:14,501 INFO L226 Difference]: Without dead ends: 388 [2022-07-13 11:27:14,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2022-07-13 11:27:14,502 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 370 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2761 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:14,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 294 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2761 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 11:27:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-07-13 11:27:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 268. [2022-07-13 11:27:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 201 states have (on average 1.2388059701492538) internal successors, (249), 211 states have internal predecessors, (249), 48 states have call successors, (48), 7 states have call predecessors, (48), 18 states have return successors, (197), 49 states have call predecessors, (197), 46 states have call successors, (197) [2022-07-13 11:27:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 494 transitions. [2022-07-13 11:27:14,529 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 494 transitions. Word has length 55 [2022-07-13 11:27:14,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:14,529 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 494 transitions. [2022-07-13 11:27:14,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:27:14,529 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 494 transitions. [2022-07-13 11:27:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:27:14,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:14,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:14,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:27:14,531 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash -954910152, now seen corresponding path program 1 times [2022-07-13 11:27:14,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:14,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666114594] [2022-07-13 11:27:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:14,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:14,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:14,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:14,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:27:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:14,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:27:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:14,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:14,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666114594] [2022-07-13 11:27:14,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666114594] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:14,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846565822] [2022-07-13 11:27:14,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:14,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:14,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:14,612 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:27:14,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 11:27:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:14,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:27:14,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:14,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:27:14,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846565822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:14,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:27:14,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-07-13 11:27:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463148977] [2022-07-13 11:27:14,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:14,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:27:14,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:14,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:27:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:27:14,765 INFO L87 Difference]: Start difference. First operand 268 states and 494 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:27:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:14,974 INFO L93 Difference]: Finished difference Result 713 states and 1469 transitions. [2022-07-13 11:27:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:27:14,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-13 11:27:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:14,978 INFO L225 Difference]: With dead ends: 713 [2022-07-13 11:27:14,978 INFO L226 Difference]: Without dead ends: 656 [2022-07-13 11:27:14,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:27:14,979 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 449 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:14,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1266 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:27:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-07-13 11:27:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 367. [2022-07-13 11:27:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 285 states have (on average 1.249122807017544) internal successors, (356), 299 states have internal predecessors, (356), 58 states have call successors, (58), 8 states have call predecessors, (58), 23 states have return successors, (212), 59 states have call predecessors, (212), 55 states have call successors, (212) [2022-07-13 11:27:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 626 transitions. [2022-07-13 11:27:15,023 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 626 transitions. Word has length 57 [2022-07-13 11:27:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:15,023 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 626 transitions. [2022-07-13 11:27:15,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:27:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 626 transitions. [2022-07-13 11:27:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:27:15,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:15,025 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:15,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:15,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 11:27:15,241 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:15,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:15,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1347937162, now seen corresponding path program 1 times [2022-07-13 11:27:15,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:15,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51994151] [2022-07-13 11:27:15,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:15,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:15,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:15,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:15,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:27:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:15,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:27:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:15,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:15,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51994151] [2022-07-13 11:27:15,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51994151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:15,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245220432] [2022-07-13 11:27:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:15,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:15,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:15,331 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:27:15,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 11:27:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:15,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:27:15,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:15,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:27:15,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245220432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:15,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:27:15,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-13 11:27:15,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218910744] [2022-07-13 11:27:15,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:15,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:27:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:15,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:27:15,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:27:15,458 INFO L87 Difference]: Start difference. First operand 367 states and 626 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:27:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:15,643 INFO L93 Difference]: Finished difference Result 940 states and 1818 transitions. [2022-07-13 11:27:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:27:15,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-13 11:27:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:15,647 INFO L225 Difference]: With dead ends: 940 [2022-07-13 11:27:15,647 INFO L226 Difference]: Without dead ends: 759 [2022-07-13 11:27:15,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:27:15,649 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 393 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:15,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1059 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:27:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-07-13 11:27:15,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 429. [2022-07-13 11:27:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 334 states have (on average 1.251497005988024) internal successors, (418), 350 states have internal predecessors, (418), 68 states have call successors, (68), 9 states have call predecessors, (68), 26 states have return successors, (228), 69 states have call predecessors, (228), 64 states have call successors, (228) [2022-07-13 11:27:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 714 transitions. [2022-07-13 11:27:15,696 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 714 transitions. Word has length 57 [2022-07-13 11:27:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:15,697 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 714 transitions. [2022-07-13 11:27:15,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:27:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 714 transitions. [2022-07-13 11:27:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:27:15,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:15,699 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:15,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:15,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:15,916 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:15,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1088923658, now seen corresponding path program 1 times [2022-07-13 11:27:15,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:15,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982225360] [2022-07-13 11:27:15,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:15,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:15,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:27:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:15,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:27:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:15,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:15,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982225360] [2022-07-13 11:27:15,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982225360] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:15,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695043699] [2022-07-13 11:27:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:15,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:15,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:16,012 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:27:16,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 11:27:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:16,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:27:16,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:16,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:27:16,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695043699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:16,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:27:16,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-07-13 11:27:16,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793896975] [2022-07-13 11:27:16,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:16,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:27:16,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:16,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:27:16,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:27:16,145 INFO L87 Difference]: Start difference. First operand 429 states and 714 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:27:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:16,242 INFO L93 Difference]: Finished difference Result 567 states and 1019 transitions. [2022-07-13 11:27:16,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:27:16,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-13 11:27:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:16,245 INFO L225 Difference]: With dead ends: 567 [2022-07-13 11:27:16,245 INFO L226 Difference]: Without dead ends: 476 [2022-07-13 11:27:16,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:27:16,246 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 52 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:16,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:27:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-07-13 11:27:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 353. [2022-07-13 11:27:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 274 states have (on average 1.2664233576642336) internal successors, (347), 288 states have internal predecessors, (347), 57 states have call successors, (57), 6 states have call predecessors, (57), 21 states have return successors, (205), 58 states have call predecessors, (205), 54 states have call successors, (205) [2022-07-13 11:27:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 609 transitions. [2022-07-13 11:27:16,290 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 609 transitions. Word has length 57 [2022-07-13 11:27:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:16,290 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 609 transitions. [2022-07-13 11:27:16,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:27:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 609 transitions. [2022-07-13 11:27:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:27:16,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:16,292 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:16,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-13 11:27:16,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:16,509 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:16,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:16,509 INFO L85 PathProgramCache]: Analyzing trace with hash 998579127, now seen corresponding path program 2 times [2022-07-13 11:27:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:16,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964200861] [2022-07-13 11:27:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:16,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:16,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:16,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:16,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:27:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:27:16,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:16,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964200861] [2022-07-13 11:27:16,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964200861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:16,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:16,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:27:16,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667631896] [2022-07-13 11:27:16,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:16,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:27:16,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:16,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:27:16,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:27:16,593 INFO L87 Difference]: Start difference. First operand 353 states and 609 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:17,100 INFO L93 Difference]: Finished difference Result 797 states and 1470 transitions. [2022-07-13 11:27:17,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:27:17,101 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2022-07-13 11:27:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:17,103 INFO L225 Difference]: With dead ends: 797 [2022-07-13 11:27:17,103 INFO L226 Difference]: Without dead ends: 548 [2022-07-13 11:27:17,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:27:17,106 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 436 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:17,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 583 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:27:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-13 11:27:17,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 454. [2022-07-13 11:27:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 365 states have (on average 1.2465753424657535) internal successors, (455), 382 states have internal predecessors, (455), 62 states have call successors, (62), 8 states have call predecessors, (62), 26 states have return successors, (197), 63 states have call predecessors, (197), 59 states have call successors, (197) [2022-07-13 11:27:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 714 transitions. [2022-07-13 11:27:17,146 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 714 transitions. Word has length 57 [2022-07-13 11:27:17,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:17,146 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 714 transitions. [2022-07-13 11:27:17,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 714 transitions. [2022-07-13 11:27:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:27:17,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:17,149 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:17,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:27:17,149 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash -12538123, now seen corresponding path program 1 times [2022-07-13 11:27:17,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:17,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216495623] [2022-07-13 11:27:17,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:17,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:17,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:17,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:27:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:27:17,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:17,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216495623] [2022-07-13 11:27:17,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216495623] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:17,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252000574] [2022-07-13 11:27:17,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:17,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:17,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:17,236 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:27:17,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 11:27:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:17,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:27:17,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:27:17,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:27:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 11:27:17,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252000574] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:17,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:27:17,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11, 10] total 12 [2022-07-13 11:27:17,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164746412] [2022-07-13 11:27:17,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:17,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:27:17,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:17,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:27:17,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:27:17,389 INFO L87 Difference]: Start difference. First operand 454 states and 714 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:17,425 INFO L93 Difference]: Finished difference Result 773 states and 1335 transitions. [2022-07-13 11:27:17,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:27:17,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2022-07-13 11:27:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:17,429 INFO L225 Difference]: With dead ends: 773 [2022-07-13 11:27:17,429 INFO L226 Difference]: Without dead ends: 474 [2022-07-13 11:27:17,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:27:17,432 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:17,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:27:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-13 11:27:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-07-13 11:27:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 385 states have (on average 1.2285714285714286) internal successors, (473), 402 states have internal predecessors, (473), 62 states have call successors, (62), 8 states have call predecessors, (62), 26 states have return successors, (197), 63 states have call predecessors, (197), 59 states have call successors, (197) [2022-07-13 11:27:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 732 transitions. [2022-07-13 11:27:17,482 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 732 transitions. Word has length 57 [2022-07-13 11:27:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:17,482 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 732 transitions. [2022-07-13 11:27:17,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 732 transitions. [2022-07-13 11:27:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:27:17,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:17,484 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:17,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:17,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-13 11:27:17,700 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:17,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:17,700 INFO L85 PathProgramCache]: Analyzing trace with hash -10691081, now seen corresponding path program 1 times [2022-07-13 11:27:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:17,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207974756] [2022-07-13 11:27:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:17,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:17,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:27:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:27:17,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:17,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207974756] [2022-07-13 11:27:17,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207974756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:17,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:17,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-13 11:27:17,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332820008] [2022-07-13 11:27:17,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:17,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 11:27:17,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 11:27:17,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:27:17,940 INFO L87 Difference]: Start difference. First operand 474 states and 732 transitions. Second operand has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:27:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:18,425 INFO L93 Difference]: Finished difference Result 801 states and 1155 transitions. [2022-07-13 11:27:18,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 11:27:18,425 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2022-07-13 11:27:18,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:18,427 INFO L225 Difference]: With dead ends: 801 [2022-07-13 11:27:18,428 INFO L226 Difference]: Without dead ends: 608 [2022-07-13 11:27:18,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:27:18,429 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 276 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:18,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 844 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:27:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-13 11:27:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 568. [2022-07-13 11:27:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 467 states have (on average 1.2098501070663812) internal successors, (565), 486 states have internal predecessors, (565), 69 states have call successors, (69), 11 states have call predecessors, (69), 31 states have return successors, (200), 70 states have call predecessors, (200), 66 states have call successors, (200) [2022-07-13 11:27:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 834 transitions. [2022-07-13 11:27:18,499 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 834 transitions. Word has length 57 [2022-07-13 11:27:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:18,499 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 834 transitions. [2022-07-13 11:27:18,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:27:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 834 transitions. [2022-07-13 11:27:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 11:27:18,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:18,501 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:18,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:27:18,502 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:18,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:18,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1534810419, now seen corresponding path program 1 times [2022-07-13 11:27:18,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:18,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629861318] [2022-07-13 11:27:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:18,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:18,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:18,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:18,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 11:27:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 11:27:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 11:27:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:27:18,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:18,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629861318] [2022-07-13 11:27:18,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629861318] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:18,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862818364] [2022-07-13 11:27:18,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:18,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:18,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:18,594 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:27:18,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 11:27:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:18,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 11:27:18,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 11:27:18,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:27:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 11:27:18,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862818364] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:27:18,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:27:18,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-07-13 11:27:18,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851950327] [2022-07-13 11:27:18,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:27:18,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 11:27:18,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:18,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 11:27:18,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:27:18,943 INFO L87 Difference]: Start difference. First operand 568 states and 834 transitions. Second operand has 23 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 5 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 11:27:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:21,529 INFO L93 Difference]: Finished difference Result 924 states and 1487 transitions. [2022-07-13 11:27:21,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-13 11:27:21,529 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 5 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 59 [2022-07-13 11:27:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:21,532 INFO L225 Difference]: With dead ends: 924 [2022-07-13 11:27:21,533 INFO L226 Difference]: Without dead ends: 791 [2022-07-13 11:27:21,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=484, Invalid=2596, Unknown=0, NotChecked=0, Total=3080 [2022-07-13 11:27:21,535 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 557 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 4812 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 4958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 4812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:21,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 581 Invalid, 4958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 4812 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-13 11:27:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-07-13 11:27:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 564. [2022-07-13 11:27:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 465 states have (on average 1.206451612903226) internal successors, (561), 484 states have internal predecessors, (561), 67 states have call successors, (67), 11 states have call predecessors, (67), 31 states have return successors, (190), 68 states have call predecessors, (190), 64 states have call successors, (190) [2022-07-13 11:27:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 818 transitions. [2022-07-13 11:27:21,588 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 818 transitions. Word has length 59 [2022-07-13 11:27:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:21,588 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 818 transitions. [2022-07-13 11:27:21,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 5 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 11:27:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 818 transitions. [2022-07-13 11:27:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:27:21,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:21,590 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:21,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:21,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:21,804 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:21,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1198827729, now seen corresponding path program 1 times [2022-07-13 11:27:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:21,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752199183] [2022-07-13 11:27:21,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:21,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:21,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:21,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:21,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:27:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:21,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 11:27:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 11:27:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:27:21,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:21,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752199183] [2022-07-13 11:27:21,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752199183] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:21,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995198999] [2022-07-13 11:27:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:21,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:21,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:21,917 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:27:21,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 11:27:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:21,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 11:27:21,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 11:27:22,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:27:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 11:27:22,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995198999] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:27:22,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:27:22,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-07-13 11:27:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738104705] [2022-07-13 11:27:22,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:27:22,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:27:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:22,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:27:22,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:27:22,168 INFO L87 Difference]: Start difference. First operand 564 states and 818 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 11:27:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:23,883 INFO L93 Difference]: Finished difference Result 1164 states and 1757 transitions. [2022-07-13 11:27:23,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 11:27:23,883 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 60 [2022-07-13 11:27:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:23,886 INFO L225 Difference]: With dead ends: 1164 [2022-07-13 11:27:23,886 INFO L226 Difference]: Without dead ends: 869 [2022-07-13 11:27:23,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=1173, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 11:27:23,888 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 949 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 3054 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 3054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:23,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 538 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 3054 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 11:27:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-07-13 11:27:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 644. [2022-07-13 11:27:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 538 states have (on average 1.1988847583643123) internal successors, (645), 560 states have internal predecessors, (645), 69 states have call successors, (69), 13 states have call predecessors, (69), 36 states have return successors, (158), 70 states have call predecessors, (158), 66 states have call successors, (158) [2022-07-13 11:27:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 872 transitions. [2022-07-13 11:27:23,947 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 872 transitions. Word has length 60 [2022-07-13 11:27:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:23,948 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 872 transitions. [2022-07-13 11:27:23,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 11:27:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 872 transitions. [2022-07-13 11:27:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 11:27:23,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:23,949 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:23,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-13 11:27:24,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:24,163 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:24,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1214292501, now seen corresponding path program 1 times [2022-07-13 11:27:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:24,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062407998] [2022-07-13 11:27:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:24,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:24,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:24,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:27:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:24,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 11:27:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:24,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:24,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062407998] [2022-07-13 11:27:24,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062407998] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:24,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424407839] [2022-07-13 11:27:24,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:24,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:24,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:24,252 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:27:24,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 11:27:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:24,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:27:24,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:24,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:27:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:24,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424407839] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:27:24,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:27:24,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-07-13 11:27:24,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728230596] [2022-07-13 11:27:24,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:27:24,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:27:24,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:24,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:27:24,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:27:24,451 INFO L87 Difference]: Start difference. First operand 644 states and 872 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 11:27:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:25,481 INFO L93 Difference]: Finished difference Result 1351 states and 1983 transitions. [2022-07-13 11:27:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 11:27:25,481 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2022-07-13 11:27:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:25,485 INFO L225 Difference]: With dead ends: 1351 [2022-07-13 11:27:25,486 INFO L226 Difference]: Without dead ends: 1128 [2022-07-13 11:27:25,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2022-07-13 11:27:25,488 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 319 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 2661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:25,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 431 Invalid, 2661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:27:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2022-07-13 11:27:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 617. [2022-07-13 11:27:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 519 states have (on average 1.2023121387283238) internal successors, (624), 539 states have internal predecessors, (624), 65 states have call successors, (65), 11 states have call predecessors, (65), 32 states have return successors, (148), 66 states have call predecessors, (148), 62 states have call successors, (148) [2022-07-13 11:27:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 837 transitions. [2022-07-13 11:27:25,585 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 837 transitions. Word has length 61 [2022-07-13 11:27:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:25,585 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 837 transitions. [2022-07-13 11:27:25,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 11:27:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 837 transitions. [2022-07-13 11:27:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:27:25,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:25,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:25,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:25,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-13 11:27:25,816 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:25,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:25,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1453926245, now seen corresponding path program 1 times [2022-07-13 11:27:25,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:25,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060721581] [2022-07-13 11:27:25,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:25,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:25,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:25,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:25,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:27:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:27:25,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:25,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060721581] [2022-07-13 11:27:25,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060721581] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:25,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319574649] [2022-07-13 11:27:25,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:25,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:25,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:25,885 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:27:25,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 11:27:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:25,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:27:25,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:27:25,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:27:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:27:26,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319574649] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:27:26,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:27:26,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-07-13 11:27:26,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862644712] [2022-07-13 11:27:26,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:27:26,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:27:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:26,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:27:26,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:27:26,035 INFO L87 Difference]: Start difference. First operand 617 states and 837 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:27:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:26,555 INFO L93 Difference]: Finished difference Result 1077 states and 1470 transitions. [2022-07-13 11:27:26,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 11:27:26,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2022-07-13 11:27:26,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:26,558 INFO L225 Difference]: With dead ends: 1077 [2022-07-13 11:27:26,558 INFO L226 Difference]: Without dead ends: 779 [2022-07-13 11:27:26,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-07-13 11:27:26,560 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 306 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:26,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 636 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:27:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-07-13 11:27:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 610. [2022-07-13 11:27:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 511 states have (on average 1.2015655577299413) internal successors, (614), 532 states have internal predecessors, (614), 65 states have call successors, (65), 11 states have call predecessors, (65), 33 states have return successors, (147), 66 states have call predecessors, (147), 62 states have call successors, (147) [2022-07-13 11:27:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 826 transitions. [2022-07-13 11:27:26,630 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 826 transitions. Word has length 60 [2022-07-13 11:27:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:26,631 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 826 transitions. [2022-07-13 11:27:26,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:27:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 826 transitions. [2022-07-13 11:27:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:27:26,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:26,633 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:26,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:26,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-13 11:27:26,848 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:26,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:26,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2131752737, now seen corresponding path program 1 times [2022-07-13 11:27:26,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:26,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732587616] [2022-07-13 11:27:26,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:26,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:26,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:26,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:27:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:27:26,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:26,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732587616] [2022-07-13 11:27:26,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732587616] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:27:26,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642244877] [2022-07-13 11:27:26,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:26,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:27:26,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:26,912 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:27:26,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 11:27:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:26,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 11:27:26,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 11:27:27,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:27:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 11:27:27,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642244877] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:27:27,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:27:27,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-07-13 11:27:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550159415] [2022-07-13 11:27:27,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:27:27,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:27:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:27:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:27:27,184 INFO L87 Difference]: Start difference. First operand 610 states and 826 transitions. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 11:27:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:28,183 INFO L93 Difference]: Finished difference Result 1342 states and 1932 transitions. [2022-07-13 11:27:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 11:27:28,184 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2022-07-13 11:27:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:28,187 INFO L225 Difference]: With dead ends: 1342 [2022-07-13 11:27:28,187 INFO L226 Difference]: Without dead ends: 968 [2022-07-13 11:27:28,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=1302, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 11:27:28,189 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 449 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:28,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 601 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:27:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-07-13 11:27:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 698. [2022-07-13 11:27:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 589 states have (on average 1.1901528013582343) internal successors, (701), 615 states have internal predecessors, (701), 68 states have call successors, (68), 13 states have call predecessors, (68), 40 states have return successors, (159), 69 states have call predecessors, (159), 65 states have call successors, (159) [2022-07-13 11:27:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 928 transitions. [2022-07-13 11:27:28,259 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 928 transitions. Word has length 60 [2022-07-13 11:27:28,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:28,259 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 928 transitions. [2022-07-13 11:27:28,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 11:27:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 928 transitions. [2022-07-13 11:27:28,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:27:28,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:28,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:28,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:28,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-13 11:27:28,492 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:28,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1940152897, now seen corresponding path program 1 times [2022-07-13 11:27:28,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:28,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096409907] [2022-07-13 11:27:28,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:28,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:28,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:27:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:27:28,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:28,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096409907] [2022-07-13 11:27:28,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096409907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:28,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:28,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 11:27:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229606329] [2022-07-13 11:27:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:28,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:27:28,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:28,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:27:28,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:27:28,551 INFO L87 Difference]: Start difference. First operand 698 states and 928 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:29,480 INFO L93 Difference]: Finished difference Result 1624 states and 2442 transitions. [2022-07-13 11:27:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 11:27:29,480 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2022-07-13 11:27:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:29,485 INFO L225 Difference]: With dead ends: 1624 [2022-07-13 11:27:29,485 INFO L226 Difference]: Without dead ends: 1444 [2022-07-13 11:27:29,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2022-07-13 11:27:29,487 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 323 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:29,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 813 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:27:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-07-13 11:27:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 889. [2022-07-13 11:27:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 756 states have (on average 1.1957671957671958) internal successors, (904), 789 states have internal predecessors, (904), 82 states have call successors, (82), 16 states have call predecessors, (82), 50 states have return successors, (188), 83 states have call predecessors, (188), 79 states have call successors, (188) [2022-07-13 11:27:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1174 transitions. [2022-07-13 11:27:29,581 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1174 transitions. Word has length 60 [2022-07-13 11:27:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:29,581 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1174 transitions. [2022-07-13 11:27:29,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:29,589 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1174 transitions. [2022-07-13 11:27:29,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:27:29,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:29,590 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:29,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 11:27:29,591 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:29,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:29,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1676987907, now seen corresponding path program 1 times [2022-07-13 11:27:29,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:29,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084745615] [2022-07-13 11:27:29,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:29,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:29,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:29,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:27:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:27:29,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:29,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084745615] [2022-07-13 11:27:29,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084745615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:29,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:29,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:27:29,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903141577] [2022-07-13 11:27:29,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:29,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:27:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:27:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:27:29,654 INFO L87 Difference]: Start difference. First operand 889 states and 1174 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:30,431 INFO L93 Difference]: Finished difference Result 1900 states and 2818 transitions. [2022-07-13 11:27:30,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 11:27:30,432 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2022-07-13 11:27:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:30,436 INFO L225 Difference]: With dead ends: 1900 [2022-07-13 11:27:30,436 INFO L226 Difference]: Without dead ends: 1583 [2022-07-13 11:27:30,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:27:30,438 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 577 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:30,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 569 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:27:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-07-13 11:27:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 996. [2022-07-13 11:27:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 845 states have (on average 1.1940828402366863) internal successors, (1009), 884 states have internal predecessors, (1009), 92 states have call successors, (92), 18 states have call predecessors, (92), 58 states have return successors, (210), 93 states have call predecessors, (210), 89 states have call successors, (210) [2022-07-13 11:27:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1311 transitions. [2022-07-13 11:27:30,547 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1311 transitions. Word has length 60 [2022-07-13 11:27:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:30,547 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1311 transitions. [2022-07-13 11:27:30,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1311 transitions. [2022-07-13 11:27:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:27:30,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:30,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:30,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 11:27:30,549 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:30,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:30,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2074166403, now seen corresponding path program 2 times [2022-07-13 11:27:30,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:30,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781334022] [2022-07-13 11:27:30,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:30,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:30,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:30,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:27:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:27:30,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:27:30,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781334022] [2022-07-13 11:27:30,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781334022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:30,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:30,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:27:30,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403626793] [2022-07-13 11:27:30,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:30,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:27:30,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:27:30,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:27:30,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:27:30,604 INFO L87 Difference]: Start difference. First operand 996 states and 1311 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:31,134 INFO L93 Difference]: Finished difference Result 1368 states and 1904 transitions. [2022-07-13 11:27:31,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 11:27:31,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2022-07-13 11:27:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:31,138 INFO L225 Difference]: With dead ends: 1368 [2022-07-13 11:27:31,138 INFO L226 Difference]: Without dead ends: 1143 [2022-07-13 11:27:31,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-07-13 11:27:31,140 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 180 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:31,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 646 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:27:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-07-13 11:27:31,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 905. [2022-07-13 11:27:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 765 states have (on average 1.188235294117647) internal successors, (909), 800 states have internal predecessors, (909), 85 states have call successors, (85), 18 states have call predecessors, (85), 54 states have return successors, (194), 86 states have call predecessors, (194), 82 states have call successors, (194) [2022-07-13 11:27:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1188 transitions. [2022-07-13 11:27:31,232 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1188 transitions. Word has length 60 [2022-07-13 11:27:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:31,233 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1188 transitions. [2022-07-13 11:27:31,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:31,233 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1188 transitions. [2022-07-13 11:27:31,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:27:31,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:31,234 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:31,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-13 11:27:31,235 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:31,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:31,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1963615586, now seen corresponding path program 1 times [2022-07-13 11:27:31,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:31,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428663586] [2022-07-13 11:27:31,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:31,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:27:31,253 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:27:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:27:31,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 11:27:31,281 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:27:31,281 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:27:31,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 11:27:31,284 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:31,287 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:27:31,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:27:31 BoogieIcfgContainer [2022-07-13 11:27:31,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:27:31,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:27:31,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:27:31,341 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:27:31,341 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:26:39" (3/4) ... [2022-07-13 11:27:31,344 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 11:27:31,344 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:27:31,345 INFO L158 Benchmark]: Toolchain (without parser) took 52335.63ms. Allocated memory was 113.2MB in the beginning and 383.8MB in the end (delta: 270.5MB). Free memory was 83.4MB in the beginning and 145.9MB in the end (delta: -62.5MB). Peak memory consumption was 208.3MB. Max. memory is 16.1GB. [2022-07-13 11:27:31,345 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory was 71.7MB in the beginning and 71.7MB in the end (delta: 49.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:27:31,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.07ms. Allocated memory was 113.2MB in the beginning and 180.4MB in the end (delta: 67.1MB). Free memory was 83.2MB in the beginning and 150.2MB in the end (delta: -67.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:27:31,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.43ms. Allocated memory is still 180.4MB. Free memory was 150.2MB in the beginning and 148.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:27:31,348 INFO L158 Benchmark]: Boogie Preprocessor took 21.04ms. Allocated memory is still 180.4MB. Free memory was 148.5MB in the beginning and 146.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:27:31,348 INFO L158 Benchmark]: RCFGBuilder took 474.08ms. Allocated memory is still 180.4MB. Free memory was 146.8MB in the beginning and 129.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 11:27:31,351 INFO L158 Benchmark]: TraceAbstraction took 51556.59ms. Allocated memory was 180.4MB in the beginning and 383.8MB in the end (delta: 203.4MB). Free memory was 129.2MB in the beginning and 146.9MB in the end (delta: -17.8MB). Peak memory consumption was 187.0MB. Max. memory is 16.1GB. [2022-07-13 11:27:31,351 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 383.8MB. Free memory was 146.9MB in the beginning and 145.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:27:31,353 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 was 71.7MB in the beginning and 71.7MB in the end (delta: 49.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.07ms. Allocated memory was 113.2MB in the beginning and 180.4MB in the end (delta: 67.1MB). Free memory was 83.2MB in the beginning and 150.2MB in the end (delta: -67.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.43ms. Allocated memory is still 180.4MB. Free memory was 150.2MB in the beginning and 148.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.04ms. Allocated memory is still 180.4MB. Free memory was 148.5MB in the beginning and 146.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 474.08ms. Allocated memory is still 180.4MB. Free memory was 146.8MB in the beginning and 129.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 51556.59ms. Allocated memory was 180.4MB in the beginning and 383.8MB in the end (delta: 203.4MB). Free memory was 129.2MB in the beginning and 146.9MB in the end (delta: -17.8MB). Peak memory consumption was 187.0MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 383.8MB. Free memory was 146.9MB in the beginning and 145.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=-125, eb=127] [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=0, m=0, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L241] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-125, eb=127, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L29] COND FALSE !(! m) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L57] COND TRUE 1 VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=0, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=0, m = m & ~ (1U << 24U)=8573157378, res=4278190080, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L78] __retres4 = res VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, __retres4=4278190080, e=-125, m=0, m = m & ~ (1U << 24U)=8573157378, res=4278190080, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, \result=8573157376, __retres4=4278190080, e=-125, m=0, m = m & ~ (1U << 24U)=8573157378, res=4278190080, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L242] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=8573157376, ea=-125, eb=127, m = m & ~ (1U << 24U)=8573157378, ma=16777216, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, \result=4294967295, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L243] RET, EXPR base2flt(mb, eb) VAL [a=4278190080, base2flt(mb, eb)=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=8573157378, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=8573157379, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4278190080, b=4294967295, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=8573157379, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=8573157379, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L101] COND FALSE !(! b) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=8573157379, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, m = m & ~ (1U << 24U)=8573157378, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, m = m & ~ (1U << 24U)=8573157378, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L110] ma = ma | (1U << 24U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, m = m & ~ (1U << 24U)=8573157378, ma=4278190084, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L111] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, m = m & ~ (1U << 24U)=8573157378, ma=4278190084, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, eb=383, m = m & ~ (1U << 24U)=8573157378, ma=4278190084, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L113] mb = mb | (1U << 24U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, eb=383, m = m & ~ (1U << 24U)=8573157378, ma=4278190084, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb=4278190090, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, cond=0, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L17] reach_error() VAL [\old(cond)=0, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, cond=0, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.4s, OverallIterations: 32, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 37.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12632 SdHoareTripleChecker+Valid, 26.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12343 mSDsluCounter, 17541 SdHoareTripleChecker+Invalid, 21.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11879 mSDsCounter, 2404 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69559 IncrementalHoareTripleChecker+Invalid, 71963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2404 mSolverCounterUnsat, 5662 mSDtfsCounter, 69559 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2804 GetRequests, 1890 SyntacticMatches, 17 SemanticMatches, 897 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6959 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=996occurred in iteration=30, InterpolantAutomatonStates: 642, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 5797 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2691 NumberOfCodeBlocks, 2691 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3322 ConstructedInterpolants, 0 QuantifiedInterpolants, 8595 SizeOfPredicates, 95 NumberOfNonLiveVariables, 3982 ConjunctsInSsa, 292 ConjunctsInUnsatCore, 63 InterpolantComputations, 18 PerfectInterpolantSequences, 1034/1247 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 [2022-07-13 11:27:31,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:27:33,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:27:33,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:27:33,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:27:33,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:27:33,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:27:33,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:27:33,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:27:33,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:27:33,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:27:33,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:27:33,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:27:33,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:27:33,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:27:33,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:27:33,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:27:33,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:27:33,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:27:33,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:27:33,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:27:33,154 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:27:33,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:27:33,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:27:33,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:27:33,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:27:33,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:27:33,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:27:33,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:27:33,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:27:33,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:27:33,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:27:33,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:27:33,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:27:33,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:27:33,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:27:33,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:27:33,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:27:33,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:27:33,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:27:33,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:27:33,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:27:33,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:27:33,174 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 11:27:33,199 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:27:33,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:27:33,199 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:27:33,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:27:33,200 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:27:33,200 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:27:33,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:27:33,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:27:33,201 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:27:33,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:27:33,202 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:27:33,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:27:33,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:27:33,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:27:33,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:27:33,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:27:33,203 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:27:33,203 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:27:33,203 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:27:33,203 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:27:33,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:27:33,204 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:27:33,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:27:33,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:27:33,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:27:33,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:27:33,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:27:33,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:27:33,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:27:33,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:27:33,205 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:27:33,205 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:27:33,205 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:27:33,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:27:33,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:27:33,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:27:33,206 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2022-07-13 11:27:33,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:27:33,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:27:33,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:27:33,452 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:27:33,452 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:27:33,453 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-13 11:27:33,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1213d67/0942e88b7e084115a34e74a08999465c/FLAG9cdce10da [2022-07-13 11:27:33,867 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:27:33,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-13 11:27:33,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1213d67/0942e88b7e084115a34e74a08999465c/FLAG9cdce10da [2022-07-13 11:27:33,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1213d67/0942e88b7e084115a34e74a08999465c [2022-07-13 11:27:33,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:27:33,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:27:33,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:27:33,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:27:33,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:27:33,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:27:33" (1/1) ... [2022-07-13 11:27:33,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639149fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:33, skipping insertion in model container [2022-07-13 11:27:33,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:27:33" (1/1) ... [2022-07-13 11:27:33,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:27:33,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:27:34,058 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/soft_float_4-3a.c.cil.c[730,743] [2022-07-13 11:27:34,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:27:34,145 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:27:34,154 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/soft_float_4-3a.c.cil.c[730,743] [2022-07-13 11:27:34,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:27:34,203 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:27:34,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:34 WrapperNode [2022-07-13 11:27:34,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:27:34,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:27:34,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:27:34,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:27:34,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:34" (1/1) ... [2022-07-13 11:27:34,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:34" (1/1) ... [2022-07-13 11:27:34,237 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2022-07-13 11:27:34,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:27:34,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:27:34,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:27:34,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:27:34,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:34" (1/1) ... [2022-07-13 11:27:34,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:34" (1/1) ... [2022-07-13 11:27:34,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:34" (1/1) ... [2022-07-13 11:27:34,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:34" (1/1) ... [2022-07-13 11:27:34,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:34" (1/1) ... [2022-07-13 11:27:34,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:34" (1/1) ... [2022-07-13 11:27:34,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:34" (1/1) ... [2022-07-13 11:27:34,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:27:34,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:27:34,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:27:34,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:27:34,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:34" (1/1) ... [2022-07-13 11:27:34,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:27:34,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:27:34,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:27:34,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:27:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:27:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:27:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-13 11:27:34,362 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-13 11:27:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:27:34,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:27:34,363 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-13 11:27:34,363 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-13 11:27:34,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 11:27:34,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 11:27:34,439 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:27:34,447 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:27:34,639 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:27:34,645 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:27:34,646 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 11:27:34,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:27:34 BoogieIcfgContainer [2022-07-13 11:27:34,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:27:34,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:27:34,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:27:34,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:27:34,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:27:33" (1/3) ... [2022-07-13 11:27:34,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8368605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:27:34, skipping insertion in model container [2022-07-13 11:27:34,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:27:34" (2/3) ... [2022-07-13 11:27:34,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8368605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:27:34, skipping insertion in model container [2022-07-13 11:27:34,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:27:34" (3/3) ... [2022-07-13 11:27:34,653 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-07-13 11:27:34,662 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:27:34,662 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:27:34,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:27:34,708 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f7486de, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b90bc84 [2022-07-13 11:27:34,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:27:34,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-13 11:27:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 11:27:34,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:34,717 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:34,717 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:34,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:34,721 INFO L85 PathProgramCache]: Analyzing trace with hash 173410466, now seen corresponding path program 1 times [2022-07-13 11:27:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:27:34,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179347715] [2022-07-13 11:27:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:34,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:27:34,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:27:34,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:27:34,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 11:27:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:34,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:27:34,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:34,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:27:34,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:27:34,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179347715] [2022-07-13 11:27:34,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179347715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:34,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:34,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:27:34,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330148712] [2022-07-13 11:27:34,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:34,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:27:34,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:27:34,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:27:34,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:27:34,923 INFO L87 Difference]: Start difference. First operand has 54 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:35,001 INFO L93 Difference]: Finished difference Result 130 states and 196 transitions. [2022-07-13 11:27:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:27:35,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-07-13 11:27:35,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:35,008 INFO L225 Difference]: With dead ends: 130 [2022-07-13 11:27:35,008 INFO L226 Difference]: Without dead ends: 71 [2022-07-13 11:27:35,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:27:35,012 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:35,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 459 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:27:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-13 11:27:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2022-07-13 11:27:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 47 states have internal predecessors, (59), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-13 11:27:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-07-13 11:27:35,039 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 31 [2022-07-13 11:27:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:35,039 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-07-13 11:27:35,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-07-13 11:27:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:27:35,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:35,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-13 11:27:35,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 11:27:35,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:27:35,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1707598935, now seen corresponding path program 1 times [2022-07-13 11:27:35,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:27:35,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525335369] [2022-07-13 11:27:35,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:35,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:27:35,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:27:35,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:27:35,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 11:27:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:35,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:27:35,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:35,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:27:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:35,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:27:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525335369] [2022-07-13 11:27:35,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525335369] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:27:35,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:27:35,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-07-13 11:27:35,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996988258] [2022-07-13 11:27:35,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:27:35,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:27:35,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:27:35,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:27:35,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:27:35,417 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:27:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:35,543 INFO L93 Difference]: Finished difference Result 121 states and 161 transitions. [2022-07-13 11:27:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:27:35,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-07-13 11:27:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:35,545 INFO L225 Difference]: With dead ends: 121 [2022-07-13 11:27:35,545 INFO L226 Difference]: Without dead ends: 93 [2022-07-13 11:27:35,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:27:35,547 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 26 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:35,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 492 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:27:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-13 11:27:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2022-07-13 11:27:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 54 states have internal predecessors, (67), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-13 11:27:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2022-07-13 11:27:35,556 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 35 [2022-07-13 11:27:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:35,556 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2022-07-13 11:27:35,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:27:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2022-07-13 11:27:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:27:35,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:35,557 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-07-13 11:27:35,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-13 11:27:35,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:27:35,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:35,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:35,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1508244029, now seen corresponding path program 1 times [2022-07-13 11:27:35,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:27:35,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883843848] [2022-07-13 11:27:35,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:35,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:27:35,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:27:35,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:27:35,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 11:27:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:35,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:27:35,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:35,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:27:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:27:35,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:27:35,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883843848] [2022-07-13 11:27:35,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883843848] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:27:35,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:27:35,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-13 11:27:35,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046298779] [2022-07-13 11:27:35,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:27:35,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:27:35,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:27:35,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:27:35,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:27:35,940 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:27:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:36,010 INFO L93 Difference]: Finished difference Result 113 states and 150 transitions. [2022-07-13 11:27:36,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:27:36,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-07-13 11:27:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:36,012 INFO L225 Difference]: With dead ends: 113 [2022-07-13 11:27:36,012 INFO L226 Difference]: Without dead ends: 89 [2022-07-13 11:27:36,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:27:36,013 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 16 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:36,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 455 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:27:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-13 11:27:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2022-07-13 11:27:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 61 states have internal predecessors, (74), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2022-07-13 11:27:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2022-07-13 11:27:36,023 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 39 [2022-07-13 11:27:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:36,023 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2022-07-13 11:27:36,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:27:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-07-13 11:27:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:27:36,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:36,025 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:27:36,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:36,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:27:36,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:36,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash -54729342, now seen corresponding path program 2 times [2022-07-13 11:27:36,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:27:36,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430853184] [2022-07-13 11:27:36,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:27:36,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:27:36,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:27:36,241 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:27:36,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 11:27:36,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 11:27:36,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:27:36,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:27:36,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 11:27:36,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:27:36,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:27:36,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430853184] [2022-07-13 11:27:36,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430853184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:36,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:36,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:27:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130909878] [2022-07-13 11:27:36,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:36,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:27:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:27:36,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:27:36,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:27:36,375 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:36,432 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2022-07-13 11:27:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:27:36,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-07-13 11:27:36,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:36,434 INFO L225 Difference]: With dead ends: 96 [2022-07-13 11:27:36,434 INFO L226 Difference]: Without dead ends: 94 [2022-07-13 11:27:36,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:27:36,435 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 9 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:36,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 337 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-13 11:27:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-13 11:27:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2022-07-13 11:27:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.253968253968254) internal successors, (79), 66 states have internal predecessors, (79), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2022-07-13 11:27:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2022-07-13 11:27:36,443 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 39 [2022-07-13 11:27:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:36,444 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2022-07-13 11:27:36,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-07-13 11:27:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:27:36,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:36,445 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:27:36,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-13 11:27:36,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:27:36,651 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:36,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:36,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2528960, now seen corresponding path program 1 times [2022-07-13 11:27:36,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:27:36,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803782302] [2022-07-13 11:27:36,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:36,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:27:36,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:27:36,655 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:27:36,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 11:27:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:36,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:27:36,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 11:27:36,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:27:36,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:27:36,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803782302] [2022-07-13 11:27:36,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803782302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:36,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:36,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:27:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869384969] [2022-07-13 11:27:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:36,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:27:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:27:36,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:27:36,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:27:36,807 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:36,861 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-07-13 11:27:36,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:27:36,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-07-13 11:27:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:36,864 INFO L225 Difference]: With dead ends: 96 [2022-07-13 11:27:36,864 INFO L226 Difference]: Without dead ends: 94 [2022-07-13 11:27:36,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:27:36,867 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 9 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:36,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 308 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-07-13 11:27:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-13 11:27:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-07-13 11:27:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 64 states have internal predecessors, (77), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2022-07-13 11:27:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2022-07-13 11:27:36,884 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 39 [2022-07-13 11:27:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:36,884 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2022-07-13 11:27:36,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:27:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2022-07-13 11:27:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:27:36,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:36,886 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-07-13 11:27:36,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:37,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:27:37,099 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:37,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1837968146, now seen corresponding path program 1 times [2022-07-13 11:27:37,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:27:37,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633579042] [2022-07-13 11:27:37,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:37,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:27:37,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:27:37,113 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:27:37,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 11:27:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:37,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 11:27:37,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:27:37,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:27:37,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:27:37,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633579042] [2022-07-13 11:27:37,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633579042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:37,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:37,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:27:37,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91064775] [2022-07-13 11:27:37,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:37,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:27:37,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:27:37,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:27:37,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:27:37,241 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 11:27:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:37,422 INFO L93 Difference]: Finished difference Result 126 states and 165 transitions. [2022-07-13 11:27:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:27:37,423 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-07-13 11:27:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:37,424 INFO L225 Difference]: With dead ends: 126 [2022-07-13 11:27:37,424 INFO L226 Difference]: Without dead ends: 119 [2022-07-13 11:27:37,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:27:37,424 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 33 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:37,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 661 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:27:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-13 11:27:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-07-13 11:27:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 74 states have internal predecessors, (89), 18 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-13 11:27:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-07-13 11:27:37,432 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 44 [2022-07-13 11:27:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:37,433 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-07-13 11:27:37,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 11:27:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-07-13 11:27:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 11:27:37,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:37,434 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:37,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:27:37,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:27:37,641 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:37,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:37,641 INFO L85 PathProgramCache]: Analyzing trace with hash 595859751, now seen corresponding path program 1 times [2022-07-13 11:27:37,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:27:37,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790664555] [2022-07-13 11:27:37,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:37,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:27:37,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:27:37,644 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:27:37,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 11:27:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:37,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:27:37,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:27:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:27:37,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:27:37,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:27:37,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790664555] [2022-07-13 11:27:37,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790664555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:27:37,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:27:37,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:27:37,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35972509] [2022-07-13 11:27:37,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:27:37,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:27:37,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:27:37,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:27:37,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:27:37,756 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:27:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:37,851 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2022-07-13 11:27:37,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:27:37,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2022-07-13 11:27:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:37,853 INFO L225 Difference]: With dead ends: 164 [2022-07-13 11:27:37,853 INFO L226 Difference]: Without dead ends: 127 [2022-07-13 11:27:37,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:27:37,854 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:37,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 518 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:27:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-13 11:27:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2022-07-13 11:27:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 81 states have internal predecessors, (95), 16 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2022-07-13 11:27:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2022-07-13 11:27:37,870 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 49 [2022-07-13 11:27:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:37,871 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2022-07-13 11:27:37,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 11:27:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2022-07-13 11:27:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:27:37,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:37,872 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:27:37,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-13 11:27:38,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:27:38,081 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:38,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:38,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1849173563, now seen corresponding path program 1 times [2022-07-13 11:27:38,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:27:38,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697752142] [2022-07-13 11:27:38,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:38,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:27:38,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:27:38,085 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:27:38,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 11:27:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:27:38,120 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:27:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:27:38,175 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-13 11:27:38,175 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:27:38,176 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:27:38,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-13 11:27:38,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:27:38,386 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-07-13 11:27:38,389 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:27:38,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:27:38 BoogieIcfgContainer [2022-07-13 11:27:38,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:27:38,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:27:38,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:27:38,417 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:27:38,417 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:27:34" (3/4) ... [2022-07-13 11:27:38,419 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 11:27:38,466 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:27:38,467 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:27:38,467 INFO L158 Benchmark]: Toolchain (without parser) took 4577.14ms. Allocated memory was 48.2MB in the beginning and 79.7MB in the end (delta: 31.5MB). Free memory was 23.1MB in the beginning and 44.0MB in the end (delta: -20.9MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2022-07-13 11:27:38,467 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 30.2MB in the beginning and 30.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:27:38,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.32ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 22.9MB in the beginning and 39.8MB in the end (delta: -16.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-13 11:27:38,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.02ms. Allocated memory is still 58.7MB. Free memory was 39.8MB in the beginning and 38.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:27:38,468 INFO L158 Benchmark]: Boogie Preprocessor took 43.75ms. Allocated memory is still 58.7MB. Free memory was 38.1MB in the beginning and 36.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:27:38,468 INFO L158 Benchmark]: RCFGBuilder took 364.68ms. Allocated memory is still 58.7MB. Free memory was 36.9MB in the beginning and 37.6MB in the end (delta: -708.0kB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-07-13 11:27:38,469 INFO L158 Benchmark]: TraceAbstraction took 3767.46ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 37.1MB in the beginning and 47.6MB in the end (delta: -10.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-07-13 11:27:38,469 INFO L158 Benchmark]: Witness Printer took 49.98ms. Allocated memory is still 79.7MB. Free memory was 47.6MB in the beginning and 44.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:27:38,482 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.13ms. Allocated memory is still 48.2MB. Free memory was 30.2MB in the beginning and 30.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.32ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 22.9MB in the beginning and 39.8MB in the end (delta: -16.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.02ms. Allocated memory is still 58.7MB. Free memory was 39.8MB in the beginning and 38.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.75ms. Allocated memory is still 58.7MB. Free memory was 38.1MB in the beginning and 36.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 364.68ms. Allocated memory is still 58.7MB. Free memory was 36.9MB in the beginning and 37.6MB in the end (delta: -708.0kB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3767.46ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 37.1MB in the beginning and 47.6MB in the end (delta: -10.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Witness Printer took 49.98ms. Allocated memory is still 79.7MB. Free memory was 47.6MB in the beginning and 44.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L241] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=2147483648, e=0, m=0, res=2147483648] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-2147483648, __retres4=2147483648, e=0, m=0, res=2147483648] [L242] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=-2147483648, ea=0, ma=16777216, zero=0] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=3221225472, e=64, m=0, res=3221225472] [L80] return (__retres4); VAL [\old(e)=64, \old(m)=16777216, \result=-1073741824, __retres4=3221225472, e=64, m=0, res=3221225472] [L243] RET, EXPR base2flt(mb, eb) VAL [a=2147483648, base2flt(mb, eb)=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=2147483648, \old(b)=3221225472] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=2147483648, \old(b)=3221225472, a=2147483648, b=3221225472] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, tmp=2147483648] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L115] delta = ea - eb VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, delta=64, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 3230 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 26 IncrementalHoareTripleChecker+Unchecked, 2747 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 520 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 483 mSDtfsCounter, 520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 95 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 321 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 341 ConstructedInterpolants, 2 QuantifiedInterpolants, 537 SizeOfPredicates, 24 NumberOfNonLiveVariables, 549 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 148/160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 11:27:38,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE