./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_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_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 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:26:18,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:26:18,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:26:18,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:26:18,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:26:18,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:26:18,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:26:18,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:26:18,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:26:18,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:26:18,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:26:18,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:26:18,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:26:18,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:26:18,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:26:18,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:26:18,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:26:18,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:26:18,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:26:18,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:26:18,492 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:26:18,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:26:18,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:26:18,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:26:18,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:26:18,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:26:18,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:26:18,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:26:18,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:26:18,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:26:18,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:26:18,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:26:18,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:26:18,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:26:18,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:26:18,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:26:18,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:26:18,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:26:18,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:26:18,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:26:18,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:26:18,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:26:18,509 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:18,530 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:26:18,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:26:18,531 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:26:18,531 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:26:18,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:26:18,532 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:26:18,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:26:18,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:26:18,533 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:26:18,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:26:18,533 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:26:18,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:26:18,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:26:18,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:26:18,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:26:18,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:26:18,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:26:18,534 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:26:18,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:26:18,535 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:26:18,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:26:18,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:26:18,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:26:18,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:26:18,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:26:18,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:26:18,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:26:18,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:26:18,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:26:18,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:26:18,537 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:26:18,537 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:26:18,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:26:18,538 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 -> 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 [2022-07-13 11:26:18,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:26:18,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:26:18,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:26:18,732 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:26:18,733 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:26:18,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2022-07-13 11:26:18,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9fcc13a8/25bdb4158b24405d9488dd750043b426/FLAG72859d124 [2022-07-13 11:26:19,132 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:26:19,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2022-07-13 11:26:19,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9fcc13a8/25bdb4158b24405d9488dd750043b426/FLAG72859d124 [2022-07-13 11:26:19,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9fcc13a8/25bdb4158b24405d9488dd750043b426 [2022-07-13 11:26:19,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:26:19,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:26:19,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:26:19,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:26:19,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:26:19,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:26:19" (1/1) ... [2022-07-13 11:26:19,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c63110a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:19, skipping insertion in model container [2022-07-13 11:26:19,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:26:19" (1/1) ... [2022-07-13 11:26:19,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:26:19,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:26:19,313 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_3a.c.cil.c[728,741] [2022-07-13 11:26:19,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:26:19,351 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:26:19,358 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_3a.c.cil.c[728,741] [2022-07-13 11:26:19,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:26:19,392 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:26:19,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:19 WrapperNode [2022-07-13 11:26:19,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:26:19,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:26:19,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:26:19,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:26:19,398 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:19" (1/1) ... [2022-07-13 11:26:19,405 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:19" (1/1) ... [2022-07-13 11:26:19,425 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 178 [2022-07-13 11:26:19,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:26:19,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:26:19,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:26:19,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:26:19,432 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:19" (1/1) ... [2022-07-13 11:26:19,432 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:19" (1/1) ... [2022-07-13 11:26:19,434 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:19" (1/1) ... [2022-07-13 11:26:19,434 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:19" (1/1) ... [2022-07-13 11:26:19,438 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:19" (1/1) ... [2022-07-13 11:26:19,444 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:19" (1/1) ... [2022-07-13 11:26:19,452 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:19" (1/1) ... [2022-07-13 11:26:19,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:26:19,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:26:19,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:26:19,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:26:19,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:19" (1/1) ... [2022-07-13 11:26:19,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:26:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:19,503 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:19,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:26:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:26:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:26:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-13 11:26:19,527 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-13 11:26:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:26:19,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:26:19,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 11:26:19,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 11:26:19,613 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:26:19,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:26:19,934 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:26:19,941 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:26:19,941 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 11:26:19,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:26:19 BoogieIcfgContainer [2022-07-13 11:26:19,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:26:19,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:26:19,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:26:19,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:26:19,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:26:19" (1/3) ... [2022-07-13 11:26:19,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672e4110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:26:19, skipping insertion in model container [2022-07-13 11:26:19,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:26:19" (2/3) ... [2022-07-13 11:26:19,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672e4110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:26:19, skipping insertion in model container [2022-07-13 11:26:19,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:26:19" (3/3) ... [2022-07-13 11:26:19,950 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2022-07-13 11:26:19,966 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:26:19,966 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:26:20,010 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:26:20,018 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@194fc872, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44fc33e1 [2022-07-13 11:26:20,018 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:26:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 78 states have (on average 1.7179487179487178) internal successors, (134), 80 states have internal predecessors, (134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 11:26:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 11:26:20,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:20,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 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:20,032 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:20,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1780268165, now seen corresponding path program 1 times [2022-07-13 11:26:20,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:20,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582283719] [2022-07-13 11:26:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:26:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 11:26:20,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:20,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582283719] [2022-07-13 11:26:20,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582283719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:20,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:20,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:26:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388382254] [2022-07-13 11:26:20,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:20,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:20,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:20,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:20,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:20,324 INFO L87 Difference]: Start difference. First operand has 87 states, 78 states have (on average 1.7179487179487178) internal successors, (134), 80 states have internal predecessors, (134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:20,424 INFO L93 Difference]: Finished difference Result 184 states and 309 transitions. [2022-07-13 11:26:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:26:20,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-07-13 11:26:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:20,434 INFO L225 Difference]: With dead ends: 184 [2022-07-13 11:26:20,434 INFO L226 Difference]: Without dead ends: 89 [2022-07-13 11:26:20,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:26:20,440 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 41 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:20,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 335 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-13 11:26:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2022-07-13 11:26:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 74 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 11:26:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions. [2022-07-13 11:26:20,475 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 41 [2022-07-13 11:26:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:20,477 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 121 transitions. [2022-07-13 11:26:20,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions. [2022-07-13 11:26:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:26:20,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:20,481 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 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:20,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:26:20,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2045217877, now seen corresponding path program 1 times [2022-07-13 11:26:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:20,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52711364] [2022-07-13 11:26:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:20,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:26:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 11:26:20,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:20,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52711364] [2022-07-13 11:26:20,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52711364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:20,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:20,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:26:20,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18050418] [2022-07-13 11:26:20,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:20,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:26:20,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:20,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:26:20,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:26:20,591 INFO L87 Difference]: Start difference. First operand 81 states and 121 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:20,632 INFO L93 Difference]: Finished difference Result 99 states and 147 transitions. [2022-07-13 11:26:20,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:20,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-13 11:26:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:20,638 INFO L225 Difference]: With dead ends: 99 [2022-07-13 11:26:20,638 INFO L226 Difference]: Without dead ends: 89 [2022-07-13 11:26:20,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:26:20,640 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 36 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:20,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 433 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:20,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-13 11:26:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2022-07-13 11:26:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.5) internal successors, (111), 74 states have internal predecessors, (111), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 11:26:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 120 transitions. [2022-07-13 11:26:20,648 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 120 transitions. Word has length 43 [2022-07-13 11:26:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:20,648 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 120 transitions. [2022-07-13 11:26:20,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2022-07-13 11:26:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:26:20,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:20,649 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 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:20,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:26:20,649 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:20,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:20,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1440402793, now seen corresponding path program 1 times [2022-07-13 11:26:20,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:20,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460732791] [2022-07-13 11:26:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:20,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:26:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:20,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:20,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460732791] [2022-07-13 11:26:20,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460732791] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:20,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903972894] [2022-07-13 11:26:20,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:20,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:20,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:20,741 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:20,742 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:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:20,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 11:26:20,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:20,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 11:26:20,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903972894] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:20,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:26:20,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 8] total 15 [2022-07-13 11:26:20,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787151826] [2022-07-13 11:26:20,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:20,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:26:20,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:20,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:26:20,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:26:20,974 INFO L87 Difference]: Start difference. First operand 81 states and 120 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:21,019 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2022-07-13 11:26:21,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:26:21,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-13 11:26:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:21,021 INFO L225 Difference]: With dead ends: 167 [2022-07-13 11:26:21,021 INFO L226 Difference]: Without dead ends: 118 [2022-07-13 11:26:21,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:26:21,022 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 50 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:21,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 559 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-13 11:26:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 87. [2022-07-13 11:26:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 79 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 11:26:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2022-07-13 11:26:21,036 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 43 [2022-07-13 11:26:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:21,037 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2022-07-13 11:26:21,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2022-07-13 11:26:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:26:21,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:21,038 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 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:21,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:26:21,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:21,252 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash 853596779, now seen corresponding path program 1 times [2022-07-13 11:26:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:21,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623603309] [2022-07-13 11:26:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:21,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:21,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:26:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:21,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:26:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623603309] [2022-07-13 11:26:21,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623603309] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067644208] [2022-07-13 11:26:21,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:21,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:21,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:21,306 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:21,307 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:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:21,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 11:26:21,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:26:21,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 11:26:21,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067644208] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:21,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:21,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 15 [2022-07-13 11:26:21,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357041635] [2022-07-13 11:26:21,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:21,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 11:26:21,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:21,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 11:26:21,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:26:21,567 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-13 11:26:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:21,985 INFO L93 Difference]: Finished difference Result 307 states and 490 transitions. [2022-07-13 11:26:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 11:26:21,986 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 43 [2022-07-13 11:26:21,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:21,987 INFO L225 Difference]: With dead ends: 307 [2022-07-13 11:26:21,987 INFO L226 Difference]: Without dead ends: 223 [2022-07-13 11:26:21,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2022-07-13 11:26:21,989 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 246 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:21,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 987 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:26:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-13 11:26:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 160. [2022-07-13 11:26:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 149 states have (on average 1.4697986577181208) internal successors, (219), 148 states have internal predecessors, (219), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 11:26:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 240 transitions. [2022-07-13 11:26:22,002 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 240 transitions. Word has length 43 [2022-07-13 11:26:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:22,002 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 240 transitions. [2022-07-13 11:26:22,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-13 11:26:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 240 transitions. [2022-07-13 11:26:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:26:22,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:22,012 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 11:26:22,028 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:22,228 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,SelfDestructingSolverStorable3 [2022-07-13 11:26:22,229 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:22,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash -662181193, now seen corresponding path program 1 times [2022-07-13 11:26:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:22,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425002479] [2022-07-13 11:26:22,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:26:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 11:26:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:22,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:22,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425002479] [2022-07-13 11:26:22,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425002479] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:22,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774332357] [2022-07-13 11:26:22,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:22,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:22,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:22,308 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:22,309 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:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:26:22,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:26:22,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:22,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774332357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:22,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:26:22,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-13 11:26:22,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105936509] [2022-07-13 11:26:22,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:22,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:26:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:22,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:26:22,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:26:22,378 INFO L87 Difference]: Start difference. First operand 160 states and 240 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, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:26:22,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:22,420 INFO L93 Difference]: Finished difference Result 322 states and 485 transitions. [2022-07-13 11:26:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:26:22,420 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, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-07-13 11:26:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:22,422 INFO L225 Difference]: With dead ends: 322 [2022-07-13 11:26:22,422 INFO L226 Difference]: Without dead ends: 169 [2022-07-13 11:26:22,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:26:22,424 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 28 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:22,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 307 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-13 11:26:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2022-07-13 11:26:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 8 states have call predecessors, (18), 5 states have call successors, (18) [2022-07-13 11:26:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2022-07-13 11:26:22,444 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 48 [2022-07-13 11:26:22,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:22,444 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2022-07-13 11:26:22,444 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, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:26:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2022-07-13 11:26:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 11:26:22,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:22,446 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 11:26:22,464 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:22,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:22,661 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:22,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:22,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1876784193, now seen corresponding path program 1 times [2022-07-13 11:26:22,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:22,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837926786] [2022-07-13 11:26:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 11:26:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 11:26:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:22,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:22,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837926786] [2022-07-13 11:26:22,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837926786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:22,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458711751] [2022-07-13 11:26:22,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:22,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:22,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:22,732 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:22,733 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:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:22,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 11:26:22,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:26:22,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:22,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458711751] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:22,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:22,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-07-13 11:26:22,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576621170] [2022-07-13 11:26:22,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:22,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:26:22,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:22,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:26:22,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:26:22,893 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 11:26:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:23,173 INFO L93 Difference]: Finished difference Result 466 states and 742 transitions. [2022-07-13 11:26:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 11:26:23,173 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-07-13 11:26:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:23,175 INFO L225 Difference]: With dead ends: 466 [2022-07-13 11:26:23,175 INFO L226 Difference]: Without dead ends: 308 [2022-07-13 11:26:23,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2022-07-13 11:26:23,176 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 403 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:23,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 800 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-13 11:26:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 181. [2022-07-13 11:26:23,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 169 states have (on average 1.4970414201183433) internal successors, (253), 169 states have internal predecessors, (253), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 8 states have call predecessors, (18), 5 states have call successors, (18) [2022-07-13 11:26:23,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 277 transitions. [2022-07-13 11:26:23,188 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 277 transitions. Word has length 51 [2022-07-13 11:26:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:23,188 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 277 transitions. [2022-07-13 11:26:23,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 11:26:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 277 transitions. [2022-07-13 11:26:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 11:26:23,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:23,189 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:23,205 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:23,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:23,401 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:23,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:23,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1192790047, now seen corresponding path program 1 times [2022-07-13 11:26:23,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:23,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253571976] [2022-07-13 11:26:23,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:23,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 11:26:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 11:26:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:23,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:23,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253571976] [2022-07-13 11:26:23,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253571976] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:23,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356741365] [2022-07-13 11:26:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:23,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:23,494 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:23,495 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:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:26:23,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:23,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 11:26:23,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356741365] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:23,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:26:23,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 7] total 14 [2022-07-13 11:26:23,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465540622] [2022-07-13 11:26:23,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:23,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:26:23,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:23,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:26:23,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:26:23,653 INFO L87 Difference]: Start difference. First operand 181 states and 277 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:23,688 INFO L93 Difference]: Finished difference Result 204 states and 301 transitions. [2022-07-13 11:26:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:26:23,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-07-13 11:26:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:23,689 INFO L225 Difference]: With dead ends: 204 [2022-07-13 11:26:23,689 INFO L226 Difference]: Without dead ends: 198 [2022-07-13 11:26:23,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:26:23,690 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 22 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:23,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 457 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-13 11:26:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2022-07-13 11:26:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 184 states have (on average 1.4619565217391304) internal successors, (269), 184 states have internal predecessors, (269), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (18), 8 states have call predecessors, (18), 5 states have call successors, (18) [2022-07-13 11:26:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 293 transitions. [2022-07-13 11:26:23,701 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 293 transitions. Word has length 55 [2022-07-13 11:26:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:23,701 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 293 transitions. [2022-07-13 11:26:23,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 293 transitions. [2022-07-13 11:26:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 11:26:23,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:23,703 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:23,723 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:26:23,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:23,920 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:23,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:23,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1135531745, now seen corresponding path program 1 times [2022-07-13 11:26:23,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:23,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005139355] [2022-07-13 11:26:23,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:23,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 11:26:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 11:26:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 11:26:23,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:23,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005139355] [2022-07-13 11:26:23,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005139355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:23,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:26:23,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:26:23,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53710784] [2022-07-13 11:26:23,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:23,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:26:23,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:23,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:26:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:26:23,964 INFO L87 Difference]: Start difference. First operand 196 states and 293 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:24,001 INFO L93 Difference]: Finished difference Result 222 states and 334 transitions. [2022-07-13 11:26:24,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:26:24,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-07-13 11:26:24,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:24,004 INFO L225 Difference]: With dead ends: 222 [2022-07-13 11:26:24,004 INFO L226 Difference]: Without dead ends: 205 [2022-07-13 11:26:24,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:26:24,005 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 38 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:24,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 662 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:26:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-13 11:26:24,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2022-07-13 11:26:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 173 states have (on average 1.4682080924855492) internal successors, (254), 174 states have internal predecessors, (254), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 11:26:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 275 transitions. [2022-07-13 11:26:24,011 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 275 transitions. Word has length 55 [2022-07-13 11:26:24,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:24,011 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 275 transitions. [2022-07-13 11:26:24,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:26:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 275 transitions. [2022-07-13 11:26:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:26:24,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:24,012 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:26:24,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:26:24,013 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:24,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:24,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1032849812, now seen corresponding path program 1 times [2022-07-13 11:26:24,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:24,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650310942] [2022-07-13 11:26:24,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:24,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 11:26:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 11:26:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:24,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:24,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650310942] [2022-07-13 11:26:24,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650310942] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:24,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396309625] [2022-07-13 11:26:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:24,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:24,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:24,066 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:26:24,081 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:26:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:26:24,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:26:24,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:26:24,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396309625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:26:24,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:26:24,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-07-13 11:26:24,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952158781] [2022-07-13 11:26:24,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:26:24,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:26:24,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:24,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:26:24,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:26:24,157 INFO L87 Difference]: Start difference. First operand 185 states and 275 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:26:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:24,286 INFO L93 Difference]: Finished difference Result 405 states and 619 transitions. [2022-07-13 11:26:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:26:24,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-13 11:26:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:24,288 INFO L225 Difference]: With dead ends: 405 [2022-07-13 11:26:24,288 INFO L226 Difference]: Without dead ends: 227 [2022-07-13 11:26:24,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:26:24,289 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 47 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:24,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 404 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:26:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-13 11:26:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 192. [2022-07-13 11:26:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 180 states have (on average 1.461111111111111) internal successors, (263), 181 states have internal predecessors, (263), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 11:26:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 284 transitions. [2022-07-13 11:26:24,297 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 284 transitions. Word has length 57 [2022-07-13 11:26:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:24,297 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 284 transitions. [2022-07-13 11:26:24,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:26:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 284 transitions. [2022-07-13 11:26:24,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:26:24,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:24,298 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:26:24,317 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:26:24,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:24,511 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:24,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash -897188252, now seen corresponding path program 1 times [2022-07-13 11:26:24,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:24,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901018559] [2022-07-13 11:26:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 11:26:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 11:26:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:24,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:24,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901018559] [2022-07-13 11:26:24,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901018559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:24,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887133689] [2022-07-13 11:26:24,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:24,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:24,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:24,576 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:26:24,577 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:26:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:24,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:26:24,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:26:24,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:24,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887133689] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:24,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:24,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-07-13 11:26:24,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438512569] [2022-07-13 11:26:24,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:24,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:26:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:24,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:26:24,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:26:24,758 INFO L87 Difference]: Start difference. First operand 192 states and 284 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 13 states have internal predecessors, (80), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:26:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:25,264 INFO L93 Difference]: Finished difference Result 528 states and 827 transitions. [2022-07-13 11:26:25,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 11:26:25,265 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 13 states have internal predecessors, (80), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2022-07-13 11:26:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:25,267 INFO L225 Difference]: With dead ends: 528 [2022-07-13 11:26:25,267 INFO L226 Difference]: Without dead ends: 343 [2022-07-13 11:26:25,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 11:26:25,268 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 572 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:25,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 637 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:26:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-13 11:26:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 189. [2022-07-13 11:26:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 177 states have (on average 1.4463276836158192) internal successors, (256), 178 states have internal predecessors, (256), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 11:26:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2022-07-13 11:26:25,278 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 60 [2022-07-13 11:26:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:25,278 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2022-07-13 11:26:25,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 13 states have internal predecessors, (80), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:26:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2022-07-13 11:26:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:26:25,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:25,279 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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:26:25,297 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:26:25,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:25,496 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:25,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash -33599038, now seen corresponding path program 1 times [2022-07-13 11:26:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:25,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888296328] [2022-07-13 11:26:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:25,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:25,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 11:26:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:25,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 11:26:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:25,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:25,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888296328] [2022-07-13 11:26:25,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888296328] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:25,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016590331] [2022-07-13 11:26:25,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:25,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:25,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:25,598 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:26:25,599 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:26:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:25,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:26:25,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:26:25,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:25,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016590331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:25,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:25,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-07-13 11:26:25,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717007763] [2022-07-13 11:26:25,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:25,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 11:26:25,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:25,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 11:26:25,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:26:25,855 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 11:26:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:26,327 INFO L93 Difference]: Finished difference Result 665 states and 1051 transitions. [2022-07-13 11:26:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 11:26:26,328 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2022-07-13 11:26:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:26,330 INFO L225 Difference]: With dead ends: 665 [2022-07-13 11:26:26,330 INFO L226 Difference]: Without dead ends: 483 [2022-07-13 11:26:26,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=654, Invalid=1326, Unknown=0, NotChecked=0, Total=1980 [2022-07-13 11:26:26,332 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 1090 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:26,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 732 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:26:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-07-13 11:26:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 210. [2022-07-13 11:26:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 198 states have (on average 1.47979797979798) internal successors, (293), 199 states have internal predecessors, (293), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 11:26:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 314 transitions. [2022-07-13 11:26:26,348 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 314 transitions. Word has length 62 [2022-07-13 11:26:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:26,348 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 314 transitions. [2022-07-13 11:26:26,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 11:26:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 314 transitions. [2022-07-13 11:26:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 11:26:26,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:26,349 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 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] [2022-07-13 11:26:26,368 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:26:26,566 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,SelfDestructingSolverStorable10 [2022-07-13 11:26:26,566 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:26,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:26,567 INFO L85 PathProgramCache]: Analyzing trace with hash 94815332, now seen corresponding path program 2 times [2022-07-13 11:26:26,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:26,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537125989] [2022-07-13 11:26:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:26,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:26,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:26,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:26,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 11:26:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:26,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 11:26:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:26,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:26,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537125989] [2022-07-13 11:26:26,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537125989] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:26,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126465326] [2022-07-13 11:26:26,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:26:26,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:26,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:26,687 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:26:26,688 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:26:26,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:26:26,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:26:26,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 11:26:26,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 25 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:26:26,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:27,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126465326] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:27,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:27,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-07-13 11:26:27,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425142975] [2022-07-13 11:26:27,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:27,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 11:26:27,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:27,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 11:26:27,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-13 11:26:27,051 INFO L87 Difference]: Start difference. First operand 210 states and 314 transitions. Second operand has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 25 states have internal predecessors, (116), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:26:38,402 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 42 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 11:26:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:48,852 INFO L93 Difference]: Finished difference Result 643 states and 1016 transitions. [2022-07-13 11:26:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-13 11:26:48,853 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 25 states have internal predecessors, (116), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-07-13 11:26:48,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:48,855 INFO L225 Difference]: With dead ends: 643 [2022-07-13 11:26:48,855 INFO L226 Difference]: Without dead ends: 440 [2022-07-13 11:26:48,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=992, Invalid=2909, Unknown=5, NotChecked=0, Total=3906 [2022-07-13 11:26:48,857 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 1127 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:48,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 1242 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:26:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-07-13 11:26:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 213. [2022-07-13 11:26:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 201 states have (on average 1.472636815920398) internal successors, (296), 202 states have internal predecessors, (296), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 11:26:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2022-07-13 11:26:48,869 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 72 [2022-07-13 11:26:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:48,870 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2022-07-13 11:26:48,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.461538461538462) internal successors, (116), 25 states have internal predecessors, (116), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:26:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2022-07-13 11:26:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-13 11:26:48,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:48,871 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 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:26:48,903 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:26:49,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:49,083 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:49,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1227676354, now seen corresponding path program 2 times [2022-07-13 11:26:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:49,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065206579] [2022-07-13 11:26:49,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:49,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:49,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:49,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 11:26:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:49,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 11:26:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 4 proven. 164 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:49,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:49,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065206579] [2022-07-13 11:26:49,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065206579] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:49,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396581520] [2022-07-13 11:26:49,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:26:49,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:49,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:49,248 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:26:49,254 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:26:49,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:26:49,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:26:49,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 11:26:49,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 25 proven. 155 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:26:49,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 4 proven. 164 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:49,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396581520] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:49,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:49,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-07-13 11:26:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335892724] [2022-07-13 11:26:49,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:49,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-13 11:26:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:49,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-13 11:26:49,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=990, Unknown=0, NotChecked=0, Total=1482 [2022-07-13 11:26:49,760 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand has 39 states, 39 states have (on average 3.7948717948717947) internal successors, (148), 38 states have internal predecessors, (148), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 11:26:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:26:50,954 INFO L93 Difference]: Finished difference Result 1030 states and 1673 transitions. [2022-07-13 11:26:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-13 11:26:50,954 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.7948717948717947) internal successors, (148), 38 states have internal predecessors, (148), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2022-07-13 11:26:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:26:50,957 INFO L225 Difference]: With dead ends: 1030 [2022-07-13 11:26:50,958 INFO L226 Difference]: Without dead ends: 824 [2022-07-13 11:26:50,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2379, Invalid=4931, Unknown=0, NotChecked=0, Total=7310 [2022-07-13 11:26:50,960 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 2268 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2268 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:26:50,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2268 Valid, 1363 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:26:50,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-07-13 11:26:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 246. [2022-07-13 11:26:50,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 234 states have (on average 1.5085470085470085) internal successors, (353), 235 states have internal predecessors, (353), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 11:26:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 374 transitions. [2022-07-13 11:26:50,989 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 374 transitions. Word has length 80 [2022-07-13 11:26:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:26:50,990 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 374 transitions. [2022-07-13 11:26:50,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.7948717948717947) internal successors, (148), 38 states have internal predecessors, (148), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 11:26:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 374 transitions. [2022-07-13 11:26:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 11:26:50,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:26:50,991 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 4, 4, 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] [2022-07-13 11:26:51,010 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:26:51,207 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,SelfDestructingSolverStorable12 [2022-07-13 11:26:51,207 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:26:51,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:26:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash 511529060, now seen corresponding path program 3 times [2022-07-13 11:26:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:26:51,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697290182] [2022-07-13 11:26:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:26:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:26:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:51,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:26:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:51,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:26:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:51,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 11:26:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:51,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 11:26:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:26:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 4 proven. 282 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:51,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:26:51,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697290182] [2022-07-13 11:26:51,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697290182] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:26:51,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204082430] [2022-07-13 11:26:51,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:26:51,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:26:51,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:26:51,495 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:26:51,496 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:26:51,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2022-07-13 11:26:51,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:26:51,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 11:26:51,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:26:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 25 proven. 273 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:26:52,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:26:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 4 proven. 282 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:26:52,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204082430] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:26:52,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:26:52,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 50 [2022-07-13 11:26:52,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741349555] [2022-07-13 11:26:52,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:26:52,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 11:26:52,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:26:52,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 11:26:52,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1831, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 11:26:52,947 INFO L87 Difference]: Start difference. First operand 246 states and 374 transitions. Second operand has 50 states, 50 states have (on average 3.76) internal successors, (188), 49 states have internal predecessors, (188), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:27:10,796 WARN L233 SmtUtils]: Spent 14.24s on a formula simplification. DAG size of input: 57 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 11:27:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:27:59,682 INFO L93 Difference]: Finished difference Result 835 states and 1329 transitions. [2022-07-13 11:27:59,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-13 11:27:59,683 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.76) internal successors, (188), 49 states have internal predecessors, (188), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 96 [2022-07-13 11:27:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:27:59,686 INFO L225 Difference]: With dead ends: 835 [2022-07-13 11:27:59,686 INFO L226 Difference]: Without dead ends: 596 [2022-07-13 11:27:59,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3406 ImplicationChecksByTransitivity, 64.4s TimeCoverageRelationStatistics Valid=2905, Invalid=9966, Unknown=11, NotChecked=0, Total=12882 [2022-07-13 11:27:59,689 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 1885 mSDsluCounter, 3452 mSDsCounter, 0 mSdLazyCounter, 4626 mSolverCounterSat, 1108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1885 SdHoareTripleChecker+Valid, 3596 SdHoareTripleChecker+Invalid, 5734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1108 IncrementalHoareTripleChecker+Valid, 4626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:27:59,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1885 Valid, 3596 Invalid, 5734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1108 Valid, 4626 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-13 11:27:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-07-13 11:27:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 243. [2022-07-13 11:27:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 231 states have (on average 1.4978354978354977) internal successors, (346), 232 states have internal predecessors, (346), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 11:27:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 367 transitions. [2022-07-13 11:27:59,705 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 367 transitions. Word has length 96 [2022-07-13 11:27:59,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:27:59,706 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 367 transitions. [2022-07-13 11:27:59,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.76) internal successors, (188), 49 states have internal predecessors, (188), 2 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:27:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 367 transitions. [2022-07-13 11:27:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 11:27:59,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:27:59,707 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 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:59,712 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:59,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 11:27:59,911 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:27:59,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:27:59,912 INFO L85 PathProgramCache]: Analyzing trace with hash -95998782, now seen corresponding path program 3 times [2022-07-13 11:27:59,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:27:59,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534789825] [2022-07-13 11:27:59,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:27:59,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:27:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:59,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:27:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:27:59,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:27:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:00,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 11:28:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:00,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 11:28:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 4 proven. 746 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:28:00,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:00,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534789825] [2022-07-13 11:28:00,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534789825] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:28:00,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558048718] [2022-07-13 11:28:00,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:28:00,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:28:00,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:28:00,277 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:28:00,278 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:29:02,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2022-07-13 11:29:02,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:29:02,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 11:29:02,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 25 proven. 737 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:29:02,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:29:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 4 proven. 746 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:29:03,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558048718] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:29:03,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:29:03,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 75 [2022-07-13 11:29:03,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604348250] [2022-07-13 11:29:03,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:29:03,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-13 11:29:03,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:03,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-13 11:29:03,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=3702, Unknown=0, NotChecked=0, Total=5550 [2022-07-13 11:29:03,530 INFO L87 Difference]: Start difference. First operand 243 states and 367 transitions. Second operand has 75 states, 75 states have (on average 3.4133333333333336) internal successors, (256), 74 states have internal predecessors, (256), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 11:29:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:07,904 INFO L93 Difference]: Finished difference Result 1747 states and 2909 transitions. [2022-07-13 11:29:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-07-13 11:29:07,905 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 3.4133333333333336) internal successors, (256), 74 states have internal predecessors, (256), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2022-07-13 11:29:07,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:07,912 INFO L225 Difference]: With dead ends: 1747 [2022-07-13 11:29:07,912 INFO L226 Difference]: Without dead ends: 1511 [2022-07-13 11:29:07,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8944 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=9130, Invalid=19262, Unknown=0, NotChecked=0, Total=28392 [2022-07-13 11:29:07,919 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 6601 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 1231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6601 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1231 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:07,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6601 Valid, 1777 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1231 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:29:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2022-07-13 11:29:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 318. [2022-07-13 11:29:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 306 states have (on average 1.5457516339869282) internal successors, (473), 307 states have internal predecessors, (473), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-13 11:29:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 494 transitions. [2022-07-13 11:29:07,976 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 494 transitions. Word has length 116 [2022-07-13 11:29:07,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:07,977 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 494 transitions. [2022-07-13 11:29:07,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.4133333333333336) internal successors, (256), 74 states have internal predecessors, (256), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 11:29:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 494 transitions. [2022-07-13 11:29:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-13 11:29:07,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:07,978 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2022-07-13 11:29:07,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 11:29:08,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 11:29:08,186 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:08,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:08,187 INFO L85 PathProgramCache]: Analyzing trace with hash 974708580, now seen corresponding path program 4 times [2022-07-13 11:29:08,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:08,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204356230] [2022-07-13 11:29:08,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:08,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:29:08,247 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:29:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:29:08,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 11:29:08,299 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:29:08,299 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:29:08,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:29:08,303 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:08,306 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:29:08,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:29:08 BoogieIcfgContainer [2022-07-13 11:29:08,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:29:08,410 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:29:08,410 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:29:08,410 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:29:08,410 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:19" (3/4) ... [2022-07-13 11:29:08,412 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 11:29:08,413 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:29:08,413 INFO L158 Benchmark]: Toolchain (without parser) took 169254.00ms. Allocated memory was 86.0MB in the beginning and 230.7MB in the end (delta: 144.7MB). Free memory was 53.2MB in the beginning and 185.3MB in the end (delta: -132.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2022-07-13 11:29:08,413 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 86.0MB. Free memory was 42.0MB in the beginning and 42.0MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:29:08,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.67ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 52.9MB in the beginning and 91.8MB in the end (delta: -38.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:29:08,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.69ms. Allocated memory is still 119.5MB. Free memory was 91.2MB in the beginning and 89.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:29:08,414 INFO L158 Benchmark]: Boogie Preprocessor took 28.36ms. Allocated memory is still 119.5MB. Free memory was 89.1MB in the beginning and 87.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:29:08,415 INFO L158 Benchmark]: RCFGBuilder took 488.29ms. Allocated memory is still 119.5MB. Free memory was 87.6MB in the beginning and 68.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 11:29:08,415 INFO L158 Benchmark]: TraceAbstraction took 168463.92ms. Allocated memory was 119.5MB in the beginning and 230.7MB in the end (delta: 111.1MB). Free memory was 68.1MB in the beginning and 185.3MB in the end (delta: -117.2MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2022-07-13 11:29:08,415 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 230.7MB. Free memory is still 185.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:29:08,417 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.10ms. Allocated memory is still 86.0MB. Free memory was 42.0MB in the beginning and 42.0MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.67ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 52.9MB in the beginning and 91.8MB in the end (delta: -38.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.69ms. Allocated memory is still 119.5MB. Free memory was 91.2MB in the beginning and 89.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.36ms. Allocated memory is still 119.5MB. Free memory was 89.1MB in the beginning and 87.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 488.29ms. Allocated memory is still 119.5MB. Free memory was 87.6MB in the beginning and 68.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 168463.92ms. Allocated memory was 119.5MB in the beginning and 230.7MB in the end (delta: 111.1MB). Free memory was 68.1MB in the beginning and 185.3MB in the end (delta: -117.2MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 230.7MB. Free memory is still 185.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=127, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=0, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=0, m=1, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=0, m=1, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=0, m=1, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=0, m=1, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-1, m=2, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-1, m=2, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-1, m=2, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-2, m=4, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-2, m=4, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-2, m=4, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-3, m=8, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-3, m=8, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-3, m=8, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-4, m=16, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-4, m=16, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-4, m=16, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-5, m=32, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-5, m=32, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-5, m=32, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-6, m=64, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-6, m=64, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-6, m=64, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-7, m=128, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-7, m=128, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-7, m=128, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-8, m=256, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-8, m=256, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-8, m=256, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-9, m=512, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-9, m=512, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-9, m=512, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-10, m=1024, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-10, m=1024, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-10, m=1024, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-11, m=2048, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-11, m=2048, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-11, m=2048, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-12, m=4096, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-12, m=4096, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-12, m=4096, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-13, m=8192, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-13, m=8192, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-13, m=8192, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-14, m=16384, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-14, m=16384, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-14, m=16384, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-15, m=32768, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-15, m=32768, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-15, m=32768, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-16, m=65536, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-16, m=65536, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-16, m=65536, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-17, m=131072, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-17, m=131072, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-17, m=131072, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-18, m=262144, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-18, m=262144, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-18, m=262144, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-19, m=524288, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-19, m=524288, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-19, m=524288, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-20, m=1048576, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-20, m=1048576, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-20, m=1048576, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-21, m=2097152, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-21, m=2097152, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-21, m=2097152, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-22, m=4194304, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-22, m=4194304, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-22, m=4194304, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-23, m=8388608, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-23, m=8388608, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-23, m=8388608, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-24, m=16777216, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-24, m=16777216, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-24, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=4294967298] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, e=-24, m=0, m = m & ~ (1U << 24U)=4294967297, res=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L78] __retres4 = res VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, __retres4=0, e=-24, m=0, m = m & ~ (1U << 24U)=4294967297, res=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=4294967298, \result=4294967296, __retres4=0, e=-24, m=0, m = m & ~ (1U << 24U)=4294967297, res=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=4294967296, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, zero=0] [L239] one = base2flt(1, 0) [L240] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L80] return (__retres4); VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, \result=4294967295, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L240] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, one=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, zero=0] [L240] a = base2flt(ma, ea) [L241] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=0, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=4294967297, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L241] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, mb=0, one=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, zero=0] [L241] b = base2flt(mb, eb) [L242] CALL, EXPR mulflt(a, b) [L148] unsigned int res ; [L149] unsigned int ma ; [L150] unsigned int mb ; [L151] unsigned long long accu ; [L152] int ea ; [L153] int eb ; [L154] unsigned int tmp ; [L155] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=0, a=4294967295, b=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L158] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=0, a=4294967295, b=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L165] COND TRUE ! b [L166] __retres10 = 0U VAL [\old(a)=4294967295, \old(b)=0, __retres10=0, a=4294967295, b=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L217] return (__retres10); VAL [\old(a)=4294967295, \old(b)=0, \result=0, __retres10=0, a=4294967295, b=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L242] RET, EXPR mulflt(a, b) [L242] r_mul = mulflt(a, b) [L244] COND FALSE !(b < one) VAL [a=4294967295, b=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, mb=0, one=0, r_mul=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, zero=0] [L247] COND FALSE !(b > one) [L250] tmp = 0 VAL [a=4294967295, b=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, mb=0, one=0, r_mul=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, tmp=0, zero=0] [L252] sb = tmp VAL [a=4294967295, b=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, mb=0, one=0, r_mul=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, sb=0, tmp=0, zero=0] [L254] COND TRUE sb == 0 VAL [a=4294967295, b=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, mb=0, one=0, r_mul=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, sb=0, tmp=0, zero=0] [L255] COND TRUE r_mul < a [L256] tmp___1 = -1 VAL [a=4294967295, b=0, ea=127, eb=0, m = m & ~ (1U << 24U)=4294967297, ma=33554432, mb=0, one=0, r_mul=0, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, sb=0, tmp=0, tmp___1=-1, zero=0] [L266] CALL __VERIFIER_assert(tmp___1 == 0) VAL [\old(cond)=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L17] reach_error() VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=4294967297, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 168.3s, OverallIterations: 16, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 96.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14454 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14454 mSDsluCounter, 14291 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12556 mSDsCounter, 3757 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8697 IncrementalHoareTripleChecker+Invalid, 12454 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3757 mSolverCounterUnsat, 1735 mSDtfsCounter, 8697 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2289 GetRequests, 1679 SyntacticMatches, 0 SemanticMatches, 610 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16820 ImplicationChecksByTransitivity, 90.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=15, InterpolantAutomatonStates: 480, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 3076 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 62.6s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1831 NumberOfCodeBlocks, 1831 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 2346 ConstructedInterpolants, 0 QuantifiedInterpolants, 8264 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2621 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 37 InterpolantComputations, 7 PerfectInterpolantSequences, 923/4853 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:29:08,512 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_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 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:29:10,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:29:10,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:29:10,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:29:10,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:29:10,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:29:10,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:29:10,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:29:10,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:29:10,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:29:10,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:29:10,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:29:10,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:29:10,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:29:10,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:29:10,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:29:10,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:29:10,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:29:10,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:29:10,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:29:10,114 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:29:10,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:29:10,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:29:10,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:29:10,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:29:10,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:29:10,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:29:10,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:29:10,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:29:10,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:29:10,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:29:10,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:29:10,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:29:10,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:29:10,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:29:10,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:29:10,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:29:10,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:29:10,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:29:10,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:29:10,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:29:10,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:29:10,132 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:29:10,156 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:29:10,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:29:10,157 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:29:10,157 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:29:10,157 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:29:10,157 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:29:10,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:29:10,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:29:10,158 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:29:10,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:29:10,159 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:29:10,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:29:10,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:29:10,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:29:10,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:29:10,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:29:10,160 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:29:10,160 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:29:10,160 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:29:10,160 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:29:10,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:29:10,161 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:29:10,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:29:10,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:29:10,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:29:10,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:29:10,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:29:10,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:29:10,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:29:10,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:29:10,162 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:29:10,162 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:29:10,162 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:29:10,163 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:29:10,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:29:10,163 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:29:10,163 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 -> 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 [2022-07-13 11:29:10,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:29:10,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:29:10,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:29:10,445 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:29:10,446 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:29:10,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2022-07-13 11:29:10,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef9c86c3d/072b7c8287144120ae8a7b6ba414b262/FLAG4e29d2964 [2022-07-13 11:29:10,825 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:29:10,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2022-07-13 11:29:10,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef9c86c3d/072b7c8287144120ae8a7b6ba414b262/FLAG4e29d2964 [2022-07-13 11:29:11,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef9c86c3d/072b7c8287144120ae8a7b6ba414b262 [2022-07-13 11:29:11,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:29:11,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:29:11,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:29:11,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:29:11,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:29:11,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:29:11" (1/1) ... [2022-07-13 11:29:11,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b156cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:11, skipping insertion in model container [2022-07-13 11:29:11,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:29:11" (1/1) ... [2022-07-13 11:29:11,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:29:11,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:29:11,388 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_3a.c.cil.c[728,741] [2022-07-13 11:29:11,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:29:11,445 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:29:11,465 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_3a.c.cil.c[728,741] [2022-07-13 11:29:11,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:29:11,492 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:29:11,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:11 WrapperNode [2022-07-13 11:29:11,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:29:11,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:29:11,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:29:11,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:29:11,497 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:29:11" (1/1) ... [2022-07-13 11:29:11,504 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:29:11" (1/1) ... [2022-07-13 11:29:11,526 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 110 [2022-07-13 11:29:11,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:29:11,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:29:11,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:29:11,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:29:11,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:11" (1/1) ... [2022-07-13 11:29:11,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:11" (1/1) ... [2022-07-13 11:29:11,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:11" (1/1) ... [2022-07-13 11:29:11,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:11" (1/1) ... [2022-07-13 11:29:11,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:11" (1/1) ... [2022-07-13 11:29:11,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:11" (1/1) ... [2022-07-13 11:29:11,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:11" (1/1) ... [2022-07-13 11:29:11,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:29:11,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:29:11,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:29:11,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:29:11,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:11" (1/1) ... [2022-07-13 11:29:11,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:29:11,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:29:11,592 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:29:11,615 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:29:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:29:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:29:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-13 11:29:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-13 11:29:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:29:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:29:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 11:29:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 11:29:11,688 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:29:11,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:29:11,930 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:29:11,934 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:29:11,947 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 11:29:11,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:29:11 BoogieIcfgContainer [2022-07-13 11:29:11,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:29:11,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:29:11,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:29:11,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:29:11,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:29:11" (1/3) ... [2022-07-13 11:29:11,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f6e34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:29:11, skipping insertion in model container [2022-07-13 11:29:11,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:11" (2/3) ... [2022-07-13 11:29:11,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f6e34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:29:11, skipping insertion in model container [2022-07-13 11:29:11,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:29:11" (3/3) ... [2022-07-13 11:29:11,954 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2022-07-13 11:29:11,966 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:29:11,966 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:29:12,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:29:12,011 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@741f30e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f565c1e [2022-07-13 11:29:12,011 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:29:12,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 44 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 11:29:12,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 11:29:12,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:12,024 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 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:29:12,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:12,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1696138713, now seen corresponding path program 1 times [2022-07-13 11:29:12,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:12,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469419896] [2022-07-13 11:29:12,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:12,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:12,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:12,041 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:29:12,042 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:29:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:29:12,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:29:12,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:29:12,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:12,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469419896] [2022-07-13 11:29:12,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469419896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:12,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:12,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:29:12,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569893345] [2022-07-13 11:29:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:12,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:29:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:12,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:29:12,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:29:12,189 INFO L87 Difference]: Start difference. First operand has 51 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 44 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:12,291 INFO L93 Difference]: Finished difference Result 113 states and 179 transitions. [2022-07-13 11:29:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:29:12,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-07-13 11:29:12,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:12,313 INFO L225 Difference]: With dead ends: 113 [2022-07-13 11:29:12,313 INFO L226 Difference]: Without dead ends: 59 [2022-07-13 11:29:12,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:29:12,317 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 16 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:12,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 161 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-13 11:29:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2022-07-13 11:29:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 11:29:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2022-07-13 11:29:12,391 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 41 [2022-07-13 11:29:12,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:12,391 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2022-07-13 11:29:12,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2022-07-13 11:29:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:29:12,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:12,393 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 11:29:12,401 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:29:12,594 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:29:12,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:12,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:12,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1421820539, now seen corresponding path program 1 times [2022-07-13 11:29:12,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:12,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145996594] [2022-07-13 11:29:12,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:12,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:12,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:12,597 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:29:12,598 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:29:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:29:12,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:29:12,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:29:12,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:12,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145996594] [2022-07-13 11:29:12,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145996594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:12,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:12,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:29:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960064116] [2022-07-13 11:29:12,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:12,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:29:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:12,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:29:12,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:29:12,692 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:12,771 INFO L93 Difference]: Finished difference Result 105 states and 150 transitions. [2022-07-13 11:29:12,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:29:12,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2022-07-13 11:29:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:12,773 INFO L225 Difference]: With dead ends: 105 [2022-07-13 11:29:12,773 INFO L226 Difference]: Without dead ends: 62 [2022-07-13 11:29:12,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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:29:12,774 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:12,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-13 11:29:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-07-13 11:29:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 11:29:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2022-07-13 11:29:12,783 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 44 [2022-07-13 11:29:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:12,783 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2022-07-13 11:29:12,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2022-07-13 11:29:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:29:12,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:12,784 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 11:29:12,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:29:12,985 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:29:12,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:12,986 INFO L85 PathProgramCache]: Analyzing trace with hash -865634876, now seen corresponding path program 1 times [2022-07-13 11:29:12,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:12,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246087347] [2022-07-13 11:29:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:12,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:12,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:12,987 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:29:12,989 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:29:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:13,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:29:13,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:29:13,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:29:13,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:13,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246087347] [2022-07-13 11:29:13,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246087347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:13,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:13,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:29:13,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714759243] [2022-07-13 11:29:13,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:13,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:29:13,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:13,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:29:13,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:29:13,066 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:13,128 INFO L93 Difference]: Finished difference Result 114 states and 162 transitions. [2022-07-13 11:29:13,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:29:13,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-07-13 11:29:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:13,130 INFO L225 Difference]: With dead ends: 114 [2022-07-13 11:29:13,130 INFO L226 Difference]: Without dead ends: 66 [2022-07-13 11:29:13,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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:29:13,131 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 16 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:13,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:29:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-13 11:29:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-07-13 11:29:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 11:29:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2022-07-13 11:29:13,156 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 45 [2022-07-13 11:29:13,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:13,156 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2022-07-13 11:29:13,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2022-07-13 11:29:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 11:29:13,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:13,158 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:29:13,167 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:29:13,358 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:29:13,359 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:13,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:13,359 INFO L85 PathProgramCache]: Analyzing trace with hash 155611130, now seen corresponding path program 1 times [2022-07-13 11:29:13,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:13,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733622265] [2022-07-13 11:29:13,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:13,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:13,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:13,361 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:29:13,362 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:29:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:13,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 11:29:13,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:13,453 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:29:13,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:29:13,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:13,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733622265] [2022-07-13 11:29:13,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733622265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:13,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:13,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:29:13,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387877942] [2022-07-13 11:29:13,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:13,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:29:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:13,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:29:13,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:13,460 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:13,559 INFO L93 Difference]: Finished difference Result 122 states and 173 transitions. [2022-07-13 11:29:13,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:13,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-07-13 11:29:13,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:13,562 INFO L225 Difference]: With dead ends: 122 [2022-07-13 11:29:13,562 INFO L226 Difference]: Without dead ends: 73 [2022-07-13 11:29:13,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:13,563 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 19 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:13,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 194 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-13 11:29:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2022-07-13 11:29:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 11:29:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2022-07-13 11:29:13,573 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 46 [2022-07-13 11:29:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:13,573 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2022-07-13 11:29:13,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2022-07-13 11:29:13,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 11:29:13,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:13,575 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 11:29:13,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:29:13,779 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:29:13,779 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:13,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash 709732423, now seen corresponding path program 1 times [2022-07-13 11:29:13,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:13,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394803937] [2022-07-13 11:29:13,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:13,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:13,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:13,785 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:29:13,788 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:29:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:13,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 11:29:13,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:29:13,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:29:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:29:14,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:14,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394803937] [2022-07-13 11:29:14,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394803937] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:29:14,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:29:14,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-13 11:29:14,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418764094] [2022-07-13 11:29:14,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:29:14,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:29:14,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:14,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:29:14,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:14,023 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:14,193 INFO L93 Difference]: Finished difference Result 143 states and 205 transitions. [2022-07-13 11:29:14,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:29:14,194 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-07-13 11:29:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:14,195 INFO L225 Difference]: With dead ends: 143 [2022-07-13 11:29:14,195 INFO L226 Difference]: Without dead ends: 93 [2022-07-13 11:29:14,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:14,196 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:14,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 266 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-13 11:29:14,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2022-07-13 11:29:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 11:29:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2022-07-13 11:29:14,214 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 47 [2022-07-13 11:29:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:14,216 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2022-07-13 11:29:14,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2022-07-13 11:29:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 11:29:14,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:14,218 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-13 11:29:14,227 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:29:14,427 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:29:14,427 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:14,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:14,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1261268282, now seen corresponding path program 1 times [2022-07-13 11:29:14,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:14,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979052716] [2022-07-13 11:29:14,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:14,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:14,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:14,429 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:29:14,431 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:29:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:14,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:29:14,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:29:14,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:29:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:29:14,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:14,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979052716] [2022-07-13 11:29:14,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979052716] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:29:14,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:29:14,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-13 11:29:14,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602386262] [2022-07-13 11:29:14,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:29:14,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:29:14,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:14,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:29:14,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:14,633 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:14,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:14,841 INFO L93 Difference]: Finished difference Result 161 states and 233 transitions. [2022-07-13 11:29:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:29:14,842 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 49 [2022-07-13 11:29:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:14,843 INFO L225 Difference]: With dead ends: 161 [2022-07-13 11:29:14,843 INFO L226 Difference]: Without dead ends: 103 [2022-07-13 11:29:14,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:29:14,844 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 105 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:14,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 360 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-13 11:29:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2022-07-13 11:29:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 11:29:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2022-07-13 11:29:14,851 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 49 [2022-07-13 11:29:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:14,852 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2022-07-13 11:29:14,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2022-07-13 11:29:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 11:29:14,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:14,853 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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] [2022-07-13 11:29:14,865 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:29:15,053 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:29:15,053 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:15,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:15,054 INFO L85 PathProgramCache]: Analyzing trace with hash 243604347, now seen corresponding path program 2 times [2022-07-13 11:29:15,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:15,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533267785] [2022-07-13 11:29:15,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:29:15,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:15,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:15,055 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:29:15,056 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:29:15,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 11:29:15,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:29:15,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:29:15,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-13 11:29:15,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:29:15,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:15,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533267785] [2022-07-13 11:29:15,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533267785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:15,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:15,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:29:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288215783] [2022-07-13 11:29:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:15,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:29:15,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:15,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:29:15,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:15,131 INFO L87 Difference]: Start difference. First operand 69 states and 100 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:29:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:15,173 INFO L93 Difference]: Finished difference Result 109 states and 158 transitions. [2022-07-13 11:29:15,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:29:15,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2022-07-13 11:29:15,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:15,175 INFO L225 Difference]: With dead ends: 109 [2022-07-13 11:29:15,175 INFO L226 Difference]: Without dead ends: 88 [2022-07-13 11:29:15,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 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:29:15,176 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 17 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:15,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 288 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:29:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-13 11:29:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2022-07-13 11:29:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 69 states have internal predecessors, (94), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 11:29:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2022-07-13 11:29:15,194 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 56 [2022-07-13 11:29:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:15,194 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2022-07-13 11:29:15,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:29:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2022-07-13 11:29:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 11:29:15,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:15,195 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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] [2022-07-13 11:29:15,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:29:15,399 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:29:15,400 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:15,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash 944668925, now seen corresponding path program 1 times [2022-07-13 11:29:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:15,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904301064] [2022-07-13 11:29:15,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:15,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:15,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:15,402 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:29:15,403 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:29:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:15,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:29:15,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:29:15,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:29:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:29:15,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:15,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904301064] [2022-07-13 11:29:15,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904301064] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:29:15,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:29:15,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-13 11:29:15,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086390914] [2022-07-13 11:29:15,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:29:15,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:29:15,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:15,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:29:15,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:29:15,751 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:16,330 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2022-07-13 11:29:16,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 11:29:16,331 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2022-07-13 11:29:16,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:16,332 INFO L225 Difference]: With dead ends: 220 [2022-07-13 11:29:16,332 INFO L226 Difference]: Without dead ends: 149 [2022-07-13 11:29:16,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:29:16,333 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 182 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:16,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 529 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-13 11:29:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 92. [2022-07-13 11:29:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 83 states have internal predecessors, (117), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 11:29:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2022-07-13 11:29:16,345 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 56 [2022-07-13 11:29:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:16,345 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2022-07-13 11:29:16,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2022-07-13 11:29:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 11:29:16,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:16,346 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 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] [2022-07-13 11:29:16,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:29:16,556 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:29:16,557 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:16,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:16,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1013596344, now seen corresponding path program 1 times [2022-07-13 11:29:16,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:16,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536838088] [2022-07-13 11:29:16,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:16,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:16,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:16,559 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:29:16,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 11:29:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:16,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:29:16,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:29:16,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:29:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 53 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:29:16,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:16,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536838088] [2022-07-13 11:29:16,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536838088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:29:16,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:29:16,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-13 11:29:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007857288] [2022-07-13 11:29:16,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:29:16,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 11:29:16,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:16,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 11:29:16,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:29:16,899 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:17,445 INFO L93 Difference]: Finished difference Result 243 states and 355 transitions. [2022-07-13 11:29:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 11:29:17,446 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2022-07-13 11:29:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:17,447 INFO L225 Difference]: With dead ends: 243 [2022-07-13 11:29:17,447 INFO L226 Difference]: Without dead ends: 158 [2022-07-13 11:29:17,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=354, Invalid=638, Unknown=0, NotChecked=0, Total=992 [2022-07-13 11:29:17,448 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 405 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:17,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 608 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-13 11:29:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 102. [2022-07-13 11:29:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 93 states have internal predecessors, (134), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 11:29:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2022-07-13 11:29:17,457 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 61 [2022-07-13 11:29:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:17,457 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2022-07-13 11:29:17,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2022-07-13 11:29:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 11:29:17,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:17,458 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 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] [2022-07-13 11:29:17,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 11:29:17,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:29:17,659 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:17,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:17,659 INFO L85 PathProgramCache]: Analyzing trace with hash -206571907, now seen corresponding path program 2 times [2022-07-13 11:29:17,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:17,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220849022] [2022-07-13 11:29:17,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:29:17,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:17,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:17,662 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:29:17,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 11:29:17,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 11:29:17,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:29:17,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:29:17,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-07-13 11:29:17,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:29:17,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:17,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220849022] [2022-07-13 11:29:17,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220849022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:17,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:17,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:29:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920313829] [2022-07-13 11:29:17,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:17,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:29:17,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:17,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:29:17,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:29:17,696 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:29:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:17,703 INFO L93 Difference]: Finished difference Result 111 states and 162 transitions. [2022-07-13 11:29:17,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:29:17,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2022-07-13 11:29:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:17,704 INFO L225 Difference]: With dead ends: 111 [2022-07-13 11:29:17,704 INFO L226 Difference]: Without dead ends: 102 [2022-07-13 11:29:17,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 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:29:17,705 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:17,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:29:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-13 11:29:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-13 11:29:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 93 states have internal predecessors, (133), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 11:29:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2022-07-13 11:29:17,712 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 74 [2022-07-13 11:29:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:17,712 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2022-07-13 11:29:17,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:29:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2022-07-13 11:29:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 11:29:17,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:17,713 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 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] [2022-07-13 11:29:17,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 11:29:17,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:29:17,919 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:17,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash -138085853, now seen corresponding path program 1 times [2022-07-13 11:29:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:17,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129599332] [2022-07-13 11:29:17,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:17,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:17,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:17,926 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:29:17,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 11:29:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:17,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 11:29:17,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:29:18,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:29:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 4 proven. 163 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:29:18,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:18,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129599332] [2022-07-13 11:29:18,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129599332] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:29:18,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:29:18,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-13 11:29:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291619835] [2022-07-13 11:29:18,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:29:18,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 11:29:18,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:18,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 11:29:18,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-13 11:29:18,857 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:21,589 INFO L93 Difference]: Finished difference Result 346 states and 503 transitions. [2022-07-13 11:29:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-13 11:29:21,590 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 76 [2022-07-13 11:29:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:21,592 INFO L225 Difference]: With dead ends: 346 [2022-07-13 11:29:21,592 INFO L226 Difference]: Without dead ends: 251 [2022-07-13 11:29:21,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=729, Invalid=1433, Unknown=0, NotChecked=0, Total=2162 [2022-07-13 11:29:21,593 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 622 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:21,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1586 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 11:29:21,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-13 11:29:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 128. [2022-07-13 11:29:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 117 states have (on average 1.5042735042735043) internal successors, (176), 119 states have internal predecessors, (176), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 11:29:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 194 transitions. [2022-07-13 11:29:21,605 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 194 transitions. Word has length 76 [2022-07-13 11:29:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:21,605 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 194 transitions. [2022-07-13 11:29:21,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 194 transitions. [2022-07-13 11:29:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 11:29:21,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:21,606 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 4, 4, 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:29:21,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-13 11:29:21,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:29:21,813 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1709984302, now seen corresponding path program 1 times [2022-07-13 11:29:21,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:21,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307069015] [2022-07-13 11:29:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:21,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:21,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:21,815 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:29:21,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 11:29:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:21,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 11:29:21,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 273 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:29:22,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:29:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 4 proven. 281 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:29:22,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:22,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307069015] [2022-07-13 11:29:22,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307069015] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:29:22,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:29:22,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-07-13 11:29:22,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362838328] [2022-07-13 11:29:22,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:29:22,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-13 11:29:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:22,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-13 11:29:22,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 11:29:22,675 INFO L87 Difference]: Start difference. First operand 128 states and 194 transitions. Second operand has 34 states, 34 states have (on average 3.588235294117647) internal successors, (122), 34 states have internal predecessors, (122), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:24,105 INFO L93 Difference]: Finished difference Result 347 states and 509 transitions. [2022-07-13 11:29:24,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-13 11:29:24,111 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.588235294117647) internal successors, (122), 34 states have internal predecessors, (122), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2022-07-13 11:29:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:24,113 INFO L225 Difference]: With dead ends: 347 [2022-07-13 11:29:24,113 INFO L226 Difference]: Without dead ends: 226 [2022-07-13 11:29:24,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=991, Invalid=2315, Unknown=0, NotChecked=0, Total=3306 [2022-07-13 11:29:24,114 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 1066 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:24,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1682 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:29:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-13 11:29:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 132. [2022-07-13 11:29:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.512396694214876) internal successors, (183), 123 states have internal predecessors, (183), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 11:29:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 201 transitions. [2022-07-13 11:29:24,136 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 201 transitions. Word has length 87 [2022-07-13 11:29:24,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:24,136 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 201 transitions. [2022-07-13 11:29:24,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.588235294117647) internal successors, (122), 34 states have internal predecessors, (122), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 201 transitions. [2022-07-13 11:29:24,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 11:29:24,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:24,138 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 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] [2022-07-13 11:29:24,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 11:29:24,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:29:24,343 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1989016285, now seen corresponding path program 2 times [2022-07-13 11:29:24,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:24,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593197211] [2022-07-13 11:29:24,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:29:24,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:24,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:24,346 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:29:24,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-13 11:29:24,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 11:29:24,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:29:24,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 11:29:24,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2022-07-13 11:29:24,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:29:24,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:24,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593197211] [2022-07-13 11:29:24,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593197211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:24,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:24,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:29:24,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359091782] [2022-07-13 11:29:24,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:24,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:29:24,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:24,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:29:24,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:29:24,398 INFO L87 Difference]: Start difference. First operand 132 states and 201 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:29:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:24,434 INFO L93 Difference]: Finished difference Result 169 states and 251 transitions. [2022-07-13 11:29:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:29:24,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 112 [2022-07-13 11:29:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:24,436 INFO L225 Difference]: With dead ends: 169 [2022-07-13 11:29:24,436 INFO L226 Difference]: Without dead ends: 159 [2022-07-13 11:29:24,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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:29:24,437 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 44 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:24,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 199 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:29:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-13 11:29:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2022-07-13 11:29:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 126 states have (on average 1.5) internal successors, (189), 128 states have internal predecessors, (189), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 11:29:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 207 transitions. [2022-07-13 11:29:24,447 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 207 transitions. Word has length 112 [2022-07-13 11:29:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:24,448 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 207 transitions. [2022-07-13 11:29:24,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:29:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 207 transitions. [2022-07-13 11:29:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 11:29:24,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:24,449 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 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] [2022-07-13 11:29:24,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-13 11:29:24,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:29:24,655 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:24,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:24,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1496604385, now seen corresponding path program 1 times [2022-07-13 11:29:24,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:24,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788533280] [2022-07-13 11:29:24,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:24,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:24,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:24,657 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:29:24,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 11:29:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:24,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 11:29:24,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 24 proven. 737 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:29:25,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:29:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 4 proven. 745 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:29:27,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:27,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788533280] [2022-07-13 11:29:27,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788533280] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:29:27,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:29:27,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-13 11:29:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324928491] [2022-07-13 11:29:27,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:29:27,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 11:29:27,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:27,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 11:29:27,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 11:29:27,572 INFO L87 Difference]: Start difference. First operand 137 states and 207 transitions. Second operand has 50 states, 50 states have (on average 3.44) internal successors, (172), 50 states have internal predecessors, (172), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:42,677 INFO L93 Difference]: Finished difference Result 590 states and 867 transitions. [2022-07-13 11:29:42,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-07-13 11:29:42,678 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.44) internal successors, (172), 50 states have internal predecessors, (172), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 112 [2022-07-13 11:29:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:42,680 INFO L225 Difference]: With dead ends: 590 [2022-07-13 11:29:42,680 INFO L226 Difference]: Without dead ends: 460 [2022-07-13 11:29:42,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=2901, Invalid=6029, Unknown=0, NotChecked=0, Total=8930 [2022-07-13 11:29:42,682 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 2282 mSDsluCounter, 4896 mSDsCounter, 0 mSdLazyCounter, 4441 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2282 SdHoareTripleChecker+Valid, 5104 SdHoareTripleChecker+Invalid, 4786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 4441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:42,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2282 Valid, 5104 Invalid, 4786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 4441 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 11:29:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-07-13 11:29:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 205. [2022-07-13 11:29:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 194 states have (on average 1.556701030927835) internal successors, (302), 196 states have internal predecessors, (302), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 11:29:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 320 transitions. [2022-07-13 11:29:42,699 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 320 transitions. Word has length 112 [2022-07-13 11:29:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:42,699 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 320 transitions. [2022-07-13 11:29:42,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.44) internal successors, (172), 50 states have internal predecessors, (172), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 11:29:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 320 transitions. [2022-07-13 11:29:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 11:29:42,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:42,700 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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:29:42,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-13 11:29:42,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:29:42,907 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:42,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash 746014060, now seen corresponding path program 1 times [2022-07-13 11:29:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:29:42,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709968177] [2022-07-13 11:29:42,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:42,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:29:42,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:29:42,909 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:29:42,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-13 11:29:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:42,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-13 11:29:42,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 10 proven. 836 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:29:44,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:29:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 10 proven. 836 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:29:47,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:29:47,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709968177] [2022-07-13 11:29:47,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709968177] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:29:47,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:29:47,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 66 [2022-07-13 11:29:47,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951768093] [2022-07-13 11:29:47,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:29:47,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-13 11:29:47,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:29:47,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-13 11:29:47,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=3524, Unknown=0, NotChecked=0, Total=4290 [2022-07-13 11:29:47,992 INFO L87 Difference]: Start difference. First operand 205 states and 320 transitions. Second operand has 66 states, 66 states have (on average 2.8636363636363638) internal successors, (189), 62 states have internal predecessors, (189), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 11:30:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:30:33,983 INFO L93 Difference]: Finished difference Result 569 states and 1122 transitions. [2022-07-13 11:30:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2022-07-13 11:30:33,984 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.8636363636363638) internal successors, (189), 62 states have internal predecessors, (189), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) Word has length 117 [2022-07-13 11:30:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:30:33,988 INFO L225 Difference]: With dead ends: 569 [2022-07-13 11:30:33,988 INFO L226 Difference]: Without dead ends: 546 [2022-07-13 11:30:33,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18854 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=11300, Invalid=45582, Unknown=0, NotChecked=0, Total=56882 [2022-07-13 11:30:33,999 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 2166 mSDsluCounter, 4392 mSDsCounter, 0 mSdLazyCounter, 12231 mSolverCounterSat, 1703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 4517 SdHoareTripleChecker+Invalid, 13934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1703 IncrementalHoareTripleChecker+Valid, 12231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:30:33,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 4517 Invalid, 13934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1703 Valid, 12231 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2022-07-13 11:30:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-13 11:30:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 223. [2022-07-13 11:30:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 209 states have (on average 1.5502392344497609) internal successors, (324), 212 states have internal predecessors, (324), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2022-07-13 11:30:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 356 transitions. [2022-07-13 11:30:34,055 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 356 transitions. Word has length 117 [2022-07-13 11:30:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:30:34,055 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 356 transitions. [2022-07-13 11:30:34,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.8636363636363638) internal successors, (189), 62 states have internal predecessors, (189), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 11:30:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 356 transitions. [2022-07-13 11:30:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 11:30:34,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:30:34,056 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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:30:34,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-13 11:30:34,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:30:34,264 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:30:34,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:30:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash -951776873, now seen corresponding path program 1 times [2022-07-13 11:30:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:30:34,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679681513] [2022-07-13 11:30:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:30:34,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:30:34,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:30:34,265 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:30:34,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-13 11:30:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:30:34,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:30:34,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:30:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2022-07-13 11:30:34,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:30:34,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:30:34,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679681513] [2022-07-13 11:30:34,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679681513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:30:34,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:30:34,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:30:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721671664] [2022-07-13 11:30:34,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:30:34,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:30:34,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:30:34,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:30:34,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:30:34,335 INFO L87 Difference]: Start difference. First operand 223 states and 356 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:30:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:30:34,376 INFO L93 Difference]: Finished difference Result 233 states and 367 transitions. [2022-07-13 11:30:34,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:30:34,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 121 [2022-07-13 11:30:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:30:34,377 INFO L225 Difference]: With dead ends: 233 [2022-07-13 11:30:34,377 INFO L226 Difference]: Without dead ends: 223 [2022-07-13 11:30:34,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 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:30:34,378 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:30:34,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:30:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-13 11:30:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 218. [2022-07-13 11:30:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 204 states have (on average 1.553921568627451) internal successors, (317), 207 states have internal predecessors, (317), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2022-07-13 11:30:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 349 transitions. [2022-07-13 11:30:34,409 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 349 transitions. Word has length 121 [2022-07-13 11:30:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:30:34,409 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 349 transitions. [2022-07-13 11:30:34,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:30:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 349 transitions. [2022-07-13 11:30:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 11:30:34,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:30:34,411 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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:30:34,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-13 11:30:34,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:30:34,618 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:30:34,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:30:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1761123499, now seen corresponding path program 1 times [2022-07-13 11:30:34,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:30:34,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966138086] [2022-07-13 11:30:34,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:30:34,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:30:34,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:30:34,620 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:30:34,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-13 11:30:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:30:34,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:30:34,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:30:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2022-07-13 11:30:34,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:30:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2022-07-13 11:30:34,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:30:34,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966138086] [2022-07-13 11:30:34,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966138086] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:30:34,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:30:34,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-13 11:30:34,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197494755] [2022-07-13 11:30:34,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:30:34,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:30:34,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:30:34,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:30:34,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:30:34,748 INFO L87 Difference]: Start difference. First operand 218 states and 349 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:30:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:30:34,809 INFO L93 Difference]: Finished difference Result 249 states and 397 transitions. [2022-07-13 11:30:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:30:34,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 121 [2022-07-13 11:30:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:30:34,811 INFO L225 Difference]: With dead ends: 249 [2022-07-13 11:30:34,811 INFO L226 Difference]: Without dead ends: 244 [2022-07-13 11:30:34,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 236 SyntacticMatches, 0 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:30:34,811 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 19 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:30:34,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 276 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:30:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-13 11:30:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2022-07-13 11:30:34,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 225 states have (on average 1.5333333333333334) internal successors, (345), 226 states have internal predecessors, (345), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (34), 11 states have call predecessors, (34), 8 states have call successors, (34) [2022-07-13 11:30:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 388 transitions. [2022-07-13 11:30:34,846 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 388 transitions. Word has length 121 [2022-07-13 11:30:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:30:34,847 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 388 transitions. [2022-07-13 11:30:34,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:30:34,847 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 388 transitions. [2022-07-13 11:30:34,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-13 11:30:34,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:30:34,848 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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:30:34,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-13 11:30:35,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:30:35,055 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:30:35,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:30:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash 598919099, now seen corresponding path program 1 times [2022-07-13 11:30:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:30:35,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318190406] [2022-07-13 11:30:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:30:35,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:30:35,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:30:35,057 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:30:35,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-13 11:30:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:30:35,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 11:30:35,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:30:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2022-07-13 11:30:35,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:30:35,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:30:35,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318190406] [2022-07-13 11:30:35,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318190406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:30:35,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:30:35,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:30:35,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663445010] [2022-07-13 11:30:35,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:30:35,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:30:35,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:30:35,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:30:35,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:30:35,134 INFO L87 Difference]: Start difference. First operand 241 states and 388 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:30:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:30:35,197 INFO L93 Difference]: Finished difference Result 264 states and 412 transitions. [2022-07-13 11:30:35,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:30:35,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 123 [2022-07-13 11:30:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:30:35,199 INFO L225 Difference]: With dead ends: 264 [2022-07-13 11:30:35,199 INFO L226 Difference]: Without dead ends: 258 [2022-07-13 11:30:35,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:30:35,200 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:30:35,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 225 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:30:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-13 11:30:35,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2022-07-13 11:30:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 240 states have (on average 1.5041666666666667) internal successors, (361), 241 states have internal predecessors, (361), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (34), 11 states have call predecessors, (34), 8 states have call successors, (34) [2022-07-13 11:30:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 404 transitions. [2022-07-13 11:30:35,228 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 404 transitions. Word has length 123 [2022-07-13 11:30:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:30:35,229 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 404 transitions. [2022-07-13 11:30:35,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:30:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 404 transitions. [2022-07-13 11:30:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-13 11:30:35,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:30:35,230 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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:30:35,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-13 11:30:35,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:30:35,437 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:30:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:30:35,438 INFO L85 PathProgramCache]: Analyzing trace with hash 656177401, now seen corresponding path program 1 times [2022-07-13 11:30:35,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:30:35,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096997909] [2022-07-13 11:30:35,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:30:35,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:30:35,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:30:35,439 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:30:35,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-13 11:30:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:30:35,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:30:35,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:30:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2022-07-13 11:30:35,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:30:35,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:30:35,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096997909] [2022-07-13 11:30:35,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096997909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:30:35,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:30:35,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:30:35,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791933227] [2022-07-13 11:30:35,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:30:35,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:30:35,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:30:35,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:30:35,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:30:35,533 INFO L87 Difference]: Start difference. First operand 256 states and 404 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:30:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:30:35,576 INFO L93 Difference]: Finished difference Result 262 states and 409 transitions. [2022-07-13 11:30:35,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:30:35,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 123 [2022-07-13 11:30:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:30:35,578 INFO L225 Difference]: With dead ends: 262 [2022-07-13 11:30:35,578 INFO L226 Difference]: Without dead ends: 245 [2022-07-13 11:30:35,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 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:30:35,579 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:30:35,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 290 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:30:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-13 11:30:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2022-07-13 11:30:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 228 states have (on average 1.513157894736842) internal successors, (345), 230 states have internal predecessors, (345), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (28), 9 states have call predecessors, (28), 7 states have call successors, (28) [2022-07-13 11:30:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 381 transitions. [2022-07-13 11:30:35,610 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 381 transitions. Word has length 123 [2022-07-13 11:30:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:30:35,611 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 381 transitions. [2022-07-13 11:30:35,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:30:35,611 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 381 transitions. [2022-07-13 11:30:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-13 11:30:35,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:30:35,612 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2022-07-13 11:30:35,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-13 11:30:35,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:30:35,819 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:30:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:30:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1103110160, now seen corresponding path program 1 times [2022-07-13 11:30:35,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:30:35,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404497340] [2022-07-13 11:30:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:30:35,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:30:35,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:30:35,821 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:30:35,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-13 11:30:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:30:35,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:30:35,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:30:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2022-07-13 11:30:35,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:30:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2022-07-13 11:30:35,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:30:35,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404497340] [2022-07-13 11:30:35,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404497340] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:30:35,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:30:35,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-13 11:30:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038869769] [2022-07-13 11:30:35,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:30:35,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:30:35,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:30:35,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:30:35,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:30:35,960 INFO L87 Difference]: Start difference. First operand 243 states and 381 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:30:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:30:36,048 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-07-13 11:30:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:30:36,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 124 [2022-07-13 11:30:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:30:36,049 INFO L225 Difference]: With dead ends: 259 [2022-07-13 11:30:36,050 INFO L226 Difference]: Without dead ends: 233 [2022-07-13 11:30:36,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:30:36,052 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 12 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:30:36,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 390 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:30:36,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-13 11:30:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 225. [2022-07-13 11:30:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 211 states have (on average 1.5308056872037914) internal successors, (323), 214 states have internal predecessors, (323), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2022-07-13 11:30:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 349 transitions. [2022-07-13 11:30:36,083 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 349 transitions. Word has length 124 [2022-07-13 11:30:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:30:36,084 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 349 transitions. [2022-07-13 11:30:36,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:30:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 349 transitions. [2022-07-13 11:30:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-13 11:30:36,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:30:36,085 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2022-07-13 11:30:36,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-13 11:30:36,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:30:36,293 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:30:36,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:30:36,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1474812810, now seen corresponding path program 2 times [2022-07-13 11:30:36,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:30:36,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552451463] [2022-07-13 11:30:36,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:30:36,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:30:36,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:30:36,295 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:30:36,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-13 11:30:36,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 11:30:36,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:30:36,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:30:36,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:30:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2022-07-13 11:30:36,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:30:36,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:30:36,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552451463] [2022-07-13 11:30:36,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552451463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:30:36,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:30:36,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:30:36,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400762438] [2022-07-13 11:30:36,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:30:36,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:30:36,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:30:36,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:30:36,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:30:36,351 INFO L87 Difference]: Start difference. First operand 225 states and 349 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:30:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:30:36,410 INFO L93 Difference]: Finished difference Result 261 states and 391 transitions. [2022-07-13 11:30:36,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:30:36,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 125 [2022-07-13 11:30:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:30:36,411 INFO L225 Difference]: With dead ends: 261 [2022-07-13 11:30:36,411 INFO L226 Difference]: Without dead ends: 249 [2022-07-13 11:30:36,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:30:36,412 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 53 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:30:36,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 249 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:30:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-13 11:30:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 226. [2022-07-13 11:30:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 212 states have (on average 1.528301886792453) internal successors, (324), 215 states have internal predecessors, (324), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2022-07-13 11:30:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 350 transitions. [2022-07-13 11:30:36,444 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 350 transitions. Word has length 125 [2022-07-13 11:30:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:30:36,444 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 350 transitions. [2022-07-13 11:30:36,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:30:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 350 transitions. [2022-07-13 11:30:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-13 11:30:36,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:30:36,445 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 4, 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] [2022-07-13 11:30:36,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-13 11:30:36,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:30:36,651 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:30:36,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:30:36,652 INFO L85 PathProgramCache]: Analyzing trace with hash 888006796, now seen corresponding path program 1 times [2022-07-13 11:30:36,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:30:36,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566389871] [2022-07-13 11:30:36,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:30:36,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:30:36,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:30:36,653 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:30:36,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-13 11:30:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:30:36,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 11:30:36,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:30:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 4 proven. 840 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:30:38,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:30:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 4 proven. 840 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:30:41,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:30:41,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566389871] [2022-07-13 11:30:41,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566389871] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:30:41,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:30:41,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2022-07-13 11:30:41,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850396774] [2022-07-13 11:30:41,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:30:41,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-13 11:30:41,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:30:41,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-13 11:30:41,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=3269, Unknown=0, NotChecked=0, Total=4032 [2022-07-13 11:30:41,579 INFO L87 Difference]: Start difference. First operand 226 states and 350 transitions. Second operand has 64 states, 64 states have (on average 2.984375) internal successors, (191), 62 states have internal predecessors, (191), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7)