./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:51:32,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:51:32,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:51:32,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:51:32,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:51:32,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:51:32,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:51:32,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:51:32,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:51:32,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:51:32,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:51:32,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:51:32,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:51:32,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:51:32,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:51:32,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:51:32,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:51:32,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:51:32,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:51:32,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:51:32,752 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:51:32,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:51:32,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:51:32,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:51:32,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:51:32,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:51:32,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:51:32,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:51:32,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:51:32,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:51:32,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:51:32,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:51:32,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:51:32,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:51:32,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:51:32,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:51:32,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:51:32,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:51:32,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:51:32,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:51:32,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:51:32,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:51:32,771 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:51:32,789 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:51:32,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:51:32,795 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:51:32,795 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:51:32,796 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:51:32,796 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:51:32,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:51:32,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:51:32,797 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:51:32,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:51:32,798 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:51:32,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:51:32,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:51:32,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:51:32,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:51:32,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:51:32,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:51:32,799 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:51:32,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:51:32,800 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:51:32,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:51:32,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:51:32,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:51:32,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:51:32,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:51:32,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:51:32,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:51:32,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:51:32,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:51:32,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:51:32,802 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:51:32,803 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:51:32,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:51:32,803 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2022-07-19 10:51:32,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:51:33,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:51:33,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:51:33,006 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:51:33,006 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:51:33,007 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-19 10:51:33,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58029a08d/47cd47c34eb949edb7e834ccf7b8fb8e/FLAGdc1faced6 [2022-07-19 10:51:33,410 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:51:33,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-19 10:51:33,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58029a08d/47cd47c34eb949edb7e834ccf7b8fb8e/FLAGdc1faced6 [2022-07-19 10:51:33,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58029a08d/47cd47c34eb949edb7e834ccf7b8fb8e [2022-07-19 10:51:33,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:51:33,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:51:33,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:51:33,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:51:33,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:51:33,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:51:33" (1/1) ... [2022-07-19 10:51:33,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1983bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33, skipping insertion in model container [2022-07-19 10:51:33,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:51:33" (1/1) ... [2022-07-19 10:51:33,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:51:33,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:51:33,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2022-07-19 10:51:33,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:51:33,628 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:51:33,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2022-07-19 10:51:33,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:51:33,667 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:51:33,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33 WrapperNode [2022-07-19 10:51:33,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:51:33,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:51:33,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:51:33,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:51:33,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33" (1/1) ... [2022-07-19 10:51:33,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33" (1/1) ... [2022-07-19 10:51:33,719 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-07-19 10:51:33,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:51:33,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:51:33,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:51:33,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:51:33,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33" (1/1) ... [2022-07-19 10:51:33,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33" (1/1) ... [2022-07-19 10:51:33,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33" (1/1) ... [2022-07-19 10:51:33,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33" (1/1) ... [2022-07-19 10:51:33,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33" (1/1) ... [2022-07-19 10:51:33,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33" (1/1) ... [2022-07-19 10:51:33,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33" (1/1) ... [2022-07-19 10:51:33,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:51:33,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:51:33,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:51:33,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:51:33,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33" (1/1) ... [2022-07-19 10:51:33,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:51:33,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:33,794 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-19 10:51:33,800 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-19 10:51:33,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:51:33,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:51:33,822 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-19 10:51:33,822 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-19 10:51:33,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:51:33,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:51:33,823 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-19 10:51:33,823 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-19 10:51:33,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 10:51:33,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 10:51:33,904 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:51:33,905 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:51:34,123 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:51:34,128 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:51:34,128 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 10:51:34,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:51:34 BoogieIcfgContainer [2022-07-19 10:51:34,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:51:34,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:51:34,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:51:34,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:51:34,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:51:33" (1/3) ... [2022-07-19 10:51:34,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d4bf9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:51:34, skipping insertion in model container [2022-07-19 10:51:34,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:33" (2/3) ... [2022-07-19 10:51:34,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d4bf9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:51:34, skipping insertion in model container [2022-07-19 10:51:34,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:51:34" (3/3) ... [2022-07-19 10:51:34,137 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-07-19 10:51:34,146 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:51:34,149 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:51:34,193 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:51:34,200 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@231834ad, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7776d1e5 [2022-07-19 10:51:34,200 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:51:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 74 states have (on average 1.6891891891891893) internal successors, (125), 75 states have internal predecessors, (125), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-19 10:51:34,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 10:51:34,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:34,213 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:34,213 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:34,217 INFO L85 PathProgramCache]: Analyzing trace with hash 176765495, now seen corresponding path program 1 times [2022-07-19 10:51:34,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:34,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678813231] [2022-07-19 10:51:34,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:34,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:34,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:34,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:34,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678813231] [2022-07-19 10:51:34,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678813231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:34,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:34,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:51:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480829590] [2022-07-19 10:51:34,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:34,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:51:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:34,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:51:34,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:51:34,483 INFO L87 Difference]: Start difference. First operand has 88 states, 74 states have (on average 1.6891891891891893) internal successors, (125), 75 states have internal predecessors, (125), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:34,580 INFO L93 Difference]: Finished difference Result 181 states and 305 transitions. [2022-07-19 10:51:34,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:51:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-07-19 10:51:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:34,590 INFO L225 Difference]: With dead ends: 181 [2022-07-19 10:51:34,590 INFO L226 Difference]: Without dead ends: 92 [2022-07-19 10:51:34,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:51:34,598 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 90 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:34,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 147 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:34,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-19 10:51:34,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2022-07-19 10:51:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 10:51:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2022-07-19 10:51:34,631 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 37 [2022-07-19 10:51:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:34,631 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2022-07-19 10:51:34,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2022-07-19 10:51:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:51:34,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:34,637 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:34,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:51:34,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:34,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1174822094, now seen corresponding path program 1 times [2022-07-19 10:51:34,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:34,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464383837] [2022-07-19 10:51:34,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:34,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:34,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:34,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:34,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:51:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:34,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:51:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:34,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:34,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464383837] [2022-07-19 10:51:34,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464383837] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:34,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990116695] [2022-07-19 10:51:34,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:34,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:34,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:34,926 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-19 10:51:34,928 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-19 10:51:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:35,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 10:51:35,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:51:35,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:35,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990116695] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:35,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:35,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 24 [2022-07-19 10:51:35,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039605652] [2022-07-19 10:51:35,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:35,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 10:51:35,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:35,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 10:51:35,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2022-07-19 10:51:35,421 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 24 states, 20 states have (on average 2.6) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-19 10:51:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:37,680 INFO L93 Difference]: Finished difference Result 419 states and 669 transitions. [2022-07-19 10:51:37,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-19 10:51:37,680 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.6) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 44 [2022-07-19 10:51:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:37,684 INFO L225 Difference]: With dead ends: 419 [2022-07-19 10:51:37,684 INFO L226 Difference]: Without dead ends: 338 [2022-07-19 10:51:37,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=1562, Unknown=0, NotChecked=0, Total=1806 [2022-07-19 10:51:37,686 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 987 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4133 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 4312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 4133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:37,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 553 Invalid, 4312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 4133 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-19 10:51:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-19 10:51:37,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 116. [2022-07-19 10:51:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 98 states have internal predecessors, (132), 14 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (22), 13 states have call predecessors, (22), 13 states have call successors, (22) [2022-07-19 10:51:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2022-07-19 10:51:37,734 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 44 [2022-07-19 10:51:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:37,735 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2022-07-19 10:51:37,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.6) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-19 10:51:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2022-07-19 10:51:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 10:51:37,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:37,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:37,760 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-19 10:51:37,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:37,942 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:37,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:37,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1191712414, now seen corresponding path program 1 times [2022-07-19 10:51:37,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:37,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393072159] [2022-07-19 10:51:37,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:37,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:37,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:37,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393072159] [2022-07-19 10:51:37,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393072159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:37,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:37,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634262710] [2022-07-19 10:51:37,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:37,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:38,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:38,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:38,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:38,002 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:38,081 INFO L93 Difference]: Finished difference Result 212 states and 306 transitions. [2022-07-19 10:51:38,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:51:38,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-19 10:51:38,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:38,083 INFO L225 Difference]: With dead ends: 212 [2022-07-19 10:51:38,083 INFO L226 Difference]: Without dead ends: 132 [2022-07-19 10:51:38,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:38,085 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 112 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:38,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 192 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-19 10:51:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 117. [2022-07-19 10:51:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 99 states have internal predecessors, (131), 14 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (22), 13 states have call predecessors, (22), 13 states have call successors, (22) [2022-07-19 10:51:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2022-07-19 10:51:38,107 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 43 [2022-07-19 10:51:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:38,108 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2022-07-19 10:51:38,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2022-07-19 10:51:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:51:38,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:38,113 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:38,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:51:38,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash 186942930, now seen corresponding path program 1 times [2022-07-19 10:51:38,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:38,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284626278] [2022-07-19 10:51:38,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:38,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:38,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:38,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:51:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:51:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:38,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:38,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284626278] [2022-07-19 10:51:38,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284626278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:38,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:38,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-19 10:51:38,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949382770] [2022-07-19 10:51:38,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:38,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:51:38,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:38,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:51:38,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:51:38,320 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-19 10:51:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:39,575 INFO L93 Difference]: Finished difference Result 250 states and 362 transitions. [2022-07-19 10:51:39,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 10:51:39,575 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2022-07-19 10:51:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:39,577 INFO L225 Difference]: With dead ends: 250 [2022-07-19 10:51:39,577 INFO L226 Difference]: Without dead ends: 242 [2022-07-19 10:51:39,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-07-19 10:51:39,578 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 288 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:39,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 462 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 10:51:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-19 10:51:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 122. [2022-07-19 10:51:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.35) internal successors, (135), 102 states have internal predecessors, (135), 15 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (23), 15 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-19 10:51:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 173 transitions. [2022-07-19 10:51:39,588 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 173 transitions. Word has length 44 [2022-07-19 10:51:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:39,588 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 173 transitions. [2022-07-19 10:51:39,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-19 10:51:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 173 transitions. [2022-07-19 10:51:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 10:51:39,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:39,590 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:39,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:51:39,590 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:39,591 INFO L85 PathProgramCache]: Analyzing trace with hash -407484938, now seen corresponding path program 1 times [2022-07-19 10:51:39,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:39,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183805404] [2022-07-19 10:51:39,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:39,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:51:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:51:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 10:51:39,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:39,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183805404] [2022-07-19 10:51:39,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183805404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:39,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:39,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:51:39,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497002548] [2022-07-19 10:51:39,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:39,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:51:39,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:39,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:51:39,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:51:39,651 INFO L87 Difference]: Start difference. First operand 122 states and 173 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 10:51:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:40,025 INFO L93 Difference]: Finished difference Result 179 states and 253 transitions. [2022-07-19 10:51:40,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:51:40,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-07-19 10:51:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:40,027 INFO L225 Difference]: With dead ends: 179 [2022-07-19 10:51:40,027 INFO L226 Difference]: Without dead ends: 168 [2022-07-19 10:51:40,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:51:40,029 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 201 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:40,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 239 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:51:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-19 10:51:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2022-07-19 10:51:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 100 states have internal predecessors, (131), 15 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (22), 14 states have call predecessors, (22), 13 states have call successors, (22) [2022-07-19 10:51:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2022-07-19 10:51:40,053 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 46 [2022-07-19 10:51:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:40,054 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2022-07-19 10:51:40,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 10:51:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2022-07-19 10:51:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 10:51:40,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:40,057 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:40,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:51:40,057 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash -167909170, now seen corresponding path program 1 times [2022-07-19 10:51:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:40,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092204459] [2022-07-19 10:51:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:40,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:40,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092204459] [2022-07-19 10:51:40,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092204459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:40,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:40,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 10:51:40,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133509932] [2022-07-19 10:51:40,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:40,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:51:40,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:40,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:51:40,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:51:40,146 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:40,413 INFO L93 Difference]: Finished difference Result 222 states and 313 transitions. [2022-07-19 10:51:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:51:40,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-07-19 10:51:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:40,415 INFO L225 Difference]: With dead ends: 222 [2022-07-19 10:51:40,415 INFO L226 Difference]: Without dead ends: 166 [2022-07-19 10:51:40,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:51:40,416 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 171 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:40,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 474 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:51:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-19 10:51:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2022-07-19 10:51:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 105 states have internal predecessors, (136), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (22), 14 states have call predecessors, (22), 13 states have call successors, (22) [2022-07-19 10:51:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2022-07-19 10:51:40,424 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 46 [2022-07-19 10:51:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:40,424 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2022-07-19 10:51:40,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2022-07-19 10:51:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:51:40,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:40,426 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:40,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:51:40,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:40,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1626225281, now seen corresponding path program 1 times [2022-07-19 10:51:40,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:40,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635832346] [2022-07-19 10:51:40,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:40,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:51:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:51:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:51:40,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:40,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635832346] [2022-07-19 10:51:40,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635832346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:40,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491548501] [2022-07-19 10:51:40,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:40,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:40,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:40,601 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-19 10:51:40,602 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-19 10:51:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-19 10:51:40,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:40,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:51:41,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491548501] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:41,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:41,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 34 [2022-07-19 10:51:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914564819] [2022-07-19 10:51:41,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:41,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 10:51:41,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:41,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 10:51:41,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2022-07-19 10:51:41,217 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand has 34 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 25 states have internal predecessors, (53), 6 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 10:51:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:46,385 INFO L93 Difference]: Finished difference Result 483 states and 769 transitions. [2022-07-19 10:51:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-19 10:51:46,395 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 25 states have internal predecessors, (53), 6 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2022-07-19 10:51:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:46,398 INFO L225 Difference]: With dead ends: 483 [2022-07-19 10:51:46,398 INFO L226 Difference]: Without dead ends: 472 [2022-07-19 10:51:46,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=739, Invalid=6233, Unknown=0, NotChecked=0, Total=6972 [2022-07-19 10:51:46,401 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 797 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 8894 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 9161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 8894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:46,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 739 Invalid, 9161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 8894 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-19 10:51:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-19 10:51:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 164. [2022-07-19 10:51:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 135 states have internal predecessors, (166), 23 states have call successors, (23), 5 states have call predecessors, (23), 11 states have return successors, (60), 23 states have call predecessors, (60), 21 states have call successors, (60) [2022-07-19 10:51:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2022-07-19 10:51:46,427 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 48 [2022-07-19 10:51:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:46,428 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2022-07-19 10:51:46,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 25 states have internal predecessors, (53), 6 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 10:51:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2022-07-19 10:51:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:51:46,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:46,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:46,449 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-19 10:51:46,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-19 10:51:46,643 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:46,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:46,644 INFO L85 PathProgramCache]: Analyzing trace with hash 976965441, now seen corresponding path program 2 times [2022-07-19 10:51:46,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:46,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247526534] [2022-07-19 10:51:46,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:46,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:46,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:46,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:46,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:46,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:51:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:46,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:51:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:51:46,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:46,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247526534] [2022-07-19 10:51:46,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247526534] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:46,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361976930] [2022-07-19 10:51:46,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:51:46,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:46,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:46,852 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-19 10:51:46,853 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-19 10:51:46,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:51:46,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:51:46,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 10:51:46,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:47,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:47,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361976930] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:47,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:47,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-07-19 10:51:47,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842545081] [2022-07-19 10:51:47,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:47,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 10:51:47,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:47,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 10:51:47,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2022-07-19 10:51:47,261 INFO L87 Difference]: Start difference. First operand 164 states and 249 transitions. Second operand has 30 states, 29 states have (on average 2.0) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-19 10:51:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:49,921 INFO L93 Difference]: Finished difference Result 348 states and 670 transitions. [2022-07-19 10:51:49,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-19 10:51:49,921 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) Word has length 48 [2022-07-19 10:51:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:49,924 INFO L225 Difference]: With dead ends: 348 [2022-07-19 10:51:49,924 INFO L226 Difference]: Without dead ends: 341 [2022-07-19 10:51:49,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=378, Invalid=3282, Unknown=0, NotChecked=0, Total=3660 [2022-07-19 10:51:49,928 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 809 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 4614 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 4828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 4614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:49,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 498 Invalid, 4828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 4614 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-19 10:51:49,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-19 10:51:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 172. [2022-07-19 10:51:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 139 states have internal predecessors, (170), 27 states have call successors, (27), 5 states have call predecessors, (27), 11 states have return successors, (75), 27 states have call predecessors, (75), 25 states have call successors, (75) [2022-07-19 10:51:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 272 transitions. [2022-07-19 10:51:49,949 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 272 transitions. Word has length 48 [2022-07-19 10:51:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:49,950 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 272 transitions. [2022-07-19 10:51:49,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-19 10:51:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 272 transitions. [2022-07-19 10:51:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:51:49,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:49,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:49,968 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-19 10:51:50,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:50,163 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:50,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1260029991, now seen corresponding path program 1 times [2022-07-19 10:51:50,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:50,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48583000] [2022-07-19 10:51:50,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:50,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:50,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:50,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:50,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:50,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:51:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:50,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:51:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:50,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:50,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48583000] [2022-07-19 10:51:50,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48583000] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:50,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403498133] [2022-07-19 10:51:50,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:50,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:50,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:50,277 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-19 10:51:50,307 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-19 10:51:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:50,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-19 10:51:50,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:51:50,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:50,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403498133] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:50,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:50,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 24 [2022-07-19 10:51:50,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970361899] [2022-07-19 10:51:50,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:50,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 10:51:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:50,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 10:51:50,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-19 10:51:50,612 INFO L87 Difference]: Start difference. First operand 172 states and 272 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 10:51:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:52,284 INFO L93 Difference]: Finished difference Result 342 states and 591 transitions. [2022-07-19 10:51:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-19 10:51:52,284 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 50 [2022-07-19 10:51:52,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:52,286 INFO L225 Difference]: With dead ends: 342 [2022-07-19 10:51:52,286 INFO L226 Difference]: Without dead ends: 331 [2022-07-19 10:51:52,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2022-07-19 10:51:52,287 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 425 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 3749 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 3825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 3749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:52,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 463 Invalid, 3825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 3749 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 10:51:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-19 10:51:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 172. [2022-07-19 10:51:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 139 states have internal predecessors, (170), 27 states have call successors, (27), 5 states have call predecessors, (27), 11 states have return successors, (75), 27 states have call predecessors, (75), 25 states have call successors, (75) [2022-07-19 10:51:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 272 transitions. [2022-07-19 10:51:52,300 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 272 transitions. Word has length 50 [2022-07-19 10:51:52,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:52,301 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 272 transitions. [2022-07-19 10:51:52,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 10:51:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 272 transitions. [2022-07-19 10:51:52,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:51:52,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:52,302 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:52,320 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-19 10:51:52,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:52,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:52,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1462321561, now seen corresponding path program 1 times [2022-07-19 10:51:52,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:52,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505239596] [2022-07-19 10:51:52,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:52,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:52,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:52,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:52,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:52,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:51:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:52,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:51:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:51:52,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:52,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505239596] [2022-07-19 10:51:52,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505239596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:52,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619966422] [2022-07-19 10:51:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:52,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:52,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:52,683 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-19 10:51:52,684 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-19 10:51:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:52,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 10:51:52,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:52,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:53,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619966422] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:53,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:53,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 31 [2022-07-19 10:51:53,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530910251] [2022-07-19 10:51:53,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:53,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-19 10:51:53,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:53,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-19 10:51:53,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=861, Unknown=0, NotChecked=0, Total=930 [2022-07-19 10:51:53,092 INFO L87 Difference]: Start difference. First operand 172 states and 272 transitions. Second operand has 31 states, 30 states have (on average 2.066666666666667) internal successors, (62), 23 states have internal predecessors, (62), 5 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 9 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-19 10:51:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:55,757 INFO L93 Difference]: Finished difference Result 343 states and 636 transitions. [2022-07-19 10:51:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-19 10:51:55,757 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.066666666666667) internal successors, (62), 23 states have internal predecessors, (62), 5 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 9 states have call predecessors, (13), 4 states have call successors, (13) Word has length 50 [2022-07-19 10:51:55,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:55,773 INFO L225 Difference]: With dead ends: 343 [2022-07-19 10:51:55,773 INFO L226 Difference]: Without dead ends: 320 [2022-07-19 10:51:55,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=449, Invalid=4107, Unknown=0, NotChecked=0, Total=4556 [2022-07-19 10:51:55,775 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 792 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 4569 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 4569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:55,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 499 Invalid, 4726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 4569 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-19 10:51:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-19 10:51:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 180. [2022-07-19 10:51:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 138 states have (on average 1.2681159420289856) internal successors, (175), 143 states have internal predecessors, (175), 30 states have call successors, (30), 5 states have call predecessors, (30), 11 states have return successors, (84), 31 states have call predecessors, (84), 28 states have call successors, (84) [2022-07-19 10:51:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 289 transitions. [2022-07-19 10:51:55,793 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 289 transitions. Word has length 50 [2022-07-19 10:51:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:55,794 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 289 transitions. [2022-07-19 10:51:55,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.066666666666667) internal successors, (62), 23 states have internal predecessors, (62), 5 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 9 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-19 10:51:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 289 transitions. [2022-07-19 10:51:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:51:55,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:55,796 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:55,816 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-19 10:51:56,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 10:51:56,014 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:56,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:56,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1556864061, now seen corresponding path program 1 times [2022-07-19 10:51:56,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:56,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919175616] [2022-07-19 10:51:56,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:56,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:56,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:56,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919175616] [2022-07-19 10:51:56,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919175616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:56,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:56,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721081964] [2022-07-19 10:51:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:56,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:56,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:56,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:56,053 INFO L87 Difference]: Start difference. First operand 180 states and 289 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:56,117 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2022-07-19 10:51:56,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:51:56,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-19 10:51:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:56,119 INFO L225 Difference]: With dead ends: 304 [2022-07-19 10:51:56,119 INFO L226 Difference]: Without dead ends: 188 [2022-07-19 10:51:56,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:56,121 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:56,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 191 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-19 10:51:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2022-07-19 10:51:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 143 states have internal predecessors, (174), 30 states have call successors, (30), 5 states have call predecessors, (30), 11 states have return successors, (84), 31 states have call predecessors, (84), 28 states have call successors, (84) [2022-07-19 10:51:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 288 transitions. [2022-07-19 10:51:56,134 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 288 transitions. Word has length 50 [2022-07-19 10:51:56,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:56,135 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 288 transitions. [2022-07-19 10:51:56,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 288 transitions. [2022-07-19 10:51:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 10:51:56,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:56,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:56,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:51:56,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:56,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:56,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1943903020, now seen corresponding path program 1 times [2022-07-19 10:51:56,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:56,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004770399] [2022-07-19 10:51:56,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:56,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 10:51:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 10:51:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:56,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:56,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004770399] [2022-07-19 10:51:56,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004770399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:56,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:56,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:51:56,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651868365] [2022-07-19 10:51:56,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:56,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:51:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:56,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:51:56,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:56,173 INFO L87 Difference]: Start difference. First operand 180 states and 288 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:51:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:56,379 INFO L93 Difference]: Finished difference Result 426 states and 705 transitions. [2022-07-19 10:51:56,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:51:56,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-07-19 10:51:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:56,381 INFO L225 Difference]: With dead ends: 426 [2022-07-19 10:51:56,381 INFO L226 Difference]: Without dead ends: 263 [2022-07-19 10:51:56,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:51:56,382 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 223 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:56,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 183 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:51:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-19 10:51:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 181. [2022-07-19 10:51:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 139 states have (on average 1.2589928057553956) internal successors, (175), 144 states have internal predecessors, (175), 30 states have call successors, (30), 5 states have call predecessors, (30), 11 states have return successors, (84), 31 states have call predecessors, (84), 28 states have call successors, (84) [2022-07-19 10:51:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 289 transitions. [2022-07-19 10:51:56,401 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 289 transitions. Word has length 52 [2022-07-19 10:51:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:56,401 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 289 transitions. [2022-07-19 10:51:56,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:51:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2022-07-19 10:51:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 10:51:56,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:56,402 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:56,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:51:56,403 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:56,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash 380344415, now seen corresponding path program 1 times [2022-07-19 10:51:56,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:56,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547505801] [2022-07-19 10:51:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 10:51:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 10:51:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:56,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547505801] [2022-07-19 10:51:56,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547505801] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:56,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245626240] [2022-07-19 10:51:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:56,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:56,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:56,530 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-19 10:51:56,531 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-19 10:51:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:56,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 10:51:56,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:51:56,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:51:56,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245626240] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:56,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:56,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2022-07-19 10:51:56,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522570993] [2022-07-19 10:51:56,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:56,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-19 10:51:56,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:56,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-19 10:51:56,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2022-07-19 10:51:56,978 INFO L87 Difference]: Start difference. First operand 181 states and 289 transitions. Second operand has 36 states, 32 states have (on average 2.21875) internal successors, (71), 28 states have internal predecessors, (71), 6 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-07-19 10:52:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:02,728 INFO L93 Difference]: Finished difference Result 673 states and 1221 transitions. [2022-07-19 10:52:02,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-19 10:52:02,728 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 2.21875) internal successors, (71), 28 states have internal predecessors, (71), 6 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 53 [2022-07-19 10:52:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:02,731 INFO L225 Difference]: With dead ends: 673 [2022-07-19 10:52:02,731 INFO L226 Difference]: Without dead ends: 553 [2022-07-19 10:52:02,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=836, Invalid=8284, Unknown=0, NotChecked=0, Total=9120 [2022-07-19 10:52:02,734 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 1059 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 10055 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 10356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 10055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:02,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 812 Invalid, 10356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 10055 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-19 10:52:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-07-19 10:52:02,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 226. [2022-07-19 10:52:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 169 states have (on average 1.2544378698224852) internal successors, (212), 177 states have internal predecessors, (212), 42 states have call successors, (42), 5 states have call predecessors, (42), 14 states have return successors, (155), 43 states have call predecessors, (155), 40 states have call successors, (155) [2022-07-19 10:52:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 409 transitions. [2022-07-19 10:52:02,761 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 409 transitions. Word has length 53 [2022-07-19 10:52:02,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:02,761 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 409 transitions. [2022-07-19 10:52:02,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 2.21875) internal successors, (71), 28 states have internal predecessors, (71), 6 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-07-19 10:52:02,761 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 409 transitions. [2022-07-19 10:52:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 10:52:02,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:02,763 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:02,791 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-19 10:52:02,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:02,975 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2040511084, now seen corresponding path program 1 times [2022-07-19 10:52:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:02,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252081698] [2022-07-19 10:52:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 10:52:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 10:52:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:52:03,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:03,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252081698] [2022-07-19 10:52:03,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252081698] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:03,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785185145] [2022-07-19 10:52:03,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:03,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:03,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:03,051 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-19 10:52:03,052 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-19 10:52:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:03,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 10:52:03,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:52:03,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:52:03,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785185145] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:03,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:03,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 20 [2022-07-19 10:52:03,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656103767] [2022-07-19 10:52:03,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:03,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 10:52:03,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:03,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 10:52:03,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:52:03,301 INFO L87 Difference]: Start difference. First operand 226 states and 409 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-19 10:52:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:05,121 INFO L93 Difference]: Finished difference Result 607 states and 1268 transitions. [2022-07-19 10:52:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 10:52:05,122 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 53 [2022-07-19 10:52:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:05,126 INFO L225 Difference]: With dead ends: 607 [2022-07-19 10:52:05,126 INFO L226 Difference]: Without dead ends: 396 [2022-07-19 10:52:05,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 10:52:05,129 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 421 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 3835 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 3927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 3835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:05,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 622 Invalid, 3927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 3835 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 10:52:05,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-19 10:52:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 257. [2022-07-19 10:52:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 190 states have (on average 1.2421052631578948) internal successors, (236), 199 states have internal predecessors, (236), 51 states have call successors, (51), 5 states have call predecessors, (51), 15 states have return successors, (208), 52 states have call predecessors, (208), 49 states have call successors, (208) [2022-07-19 10:52:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 495 transitions. [2022-07-19 10:52:05,154 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 495 transitions. Word has length 53 [2022-07-19 10:52:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:05,155 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 495 transitions. [2022-07-19 10:52:05,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-19 10:52:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 495 transitions. [2022-07-19 10:52:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 10:52:05,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:05,156 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:05,185 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-19 10:52:05,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:05,371 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:05,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:05,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1827539848, now seen corresponding path program 1 times [2022-07-19 10:52:05,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:05,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398982625] [2022-07-19 10:52:05,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:05,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:05,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:52:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:05,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:05,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398982625] [2022-07-19 10:52:05,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398982625] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:05,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871234824] [2022-07-19 10:52:05,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:05,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:05,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:05,445 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-19 10:52:05,446 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-19 10:52:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:05,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:52:05,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:05,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:05,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871234824] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:05,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:05,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-07-19 10:52:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59856653] [2022-07-19 10:52:05,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:05,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 10:52:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 10:52:05,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:52:05,651 INFO L87 Difference]: Start difference. First operand 257 states and 495 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:52:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:06,411 INFO L93 Difference]: Finished difference Result 612 states and 1350 transitions. [2022-07-19 10:52:06,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:52:06,418 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2022-07-19 10:52:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:06,421 INFO L225 Difference]: With dead ends: 612 [2022-07-19 10:52:06,422 INFO L226 Difference]: Without dead ends: 495 [2022-07-19 10:52:06,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2022-07-19 10:52:06,423 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 225 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:06,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 863 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 10:52:06,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-07-19 10:52:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 269. [2022-07-19 10:52:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 201 states have (on average 1.2338308457711442) internal successors, (248), 211 states have internal predecessors, (248), 49 states have call successors, (49), 7 states have call predecessors, (49), 18 states have return successors, (198), 50 states have call predecessors, (198), 47 states have call successors, (198) [2022-07-19 10:52:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 495 transitions. [2022-07-19 10:52:06,464 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 495 transitions. Word has length 53 [2022-07-19 10:52:06,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:06,464 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 495 transitions. [2022-07-19 10:52:06,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:52:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 495 transitions. [2022-07-19 10:52:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 10:52:06,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:06,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:06,485 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-19 10:52:06,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 10:52:06,679 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2006096899, now seen corresponding path program 1 times [2022-07-19 10:52:06,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:06,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595067847] [2022-07-19 10:52:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:06,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:06,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 10:52:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:06,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:52:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:06,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 10:52:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:52:06,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:06,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595067847] [2022-07-19 10:52:06,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595067847] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:06,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408923795] [2022-07-19 10:52:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:06,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:06,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:06,730 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-19 10:52:06,730 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-19 10:52:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:06,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 10:52:06,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 10:52:06,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:06,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408923795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:06,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:52:06,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-19 10:52:06,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826205649] [2022-07-19 10:52:06,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:06,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:52:06,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:06,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:52:06,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:52:06,802 INFO L87 Difference]: Start difference. First operand 269 states and 495 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:52:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:06,850 INFO L93 Difference]: Finished difference Result 496 states and 887 transitions. [2022-07-19 10:52:06,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:52:06,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-07-19 10:52:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:06,853 INFO L225 Difference]: With dead ends: 496 [2022-07-19 10:52:06,853 INFO L226 Difference]: Without dead ends: 276 [2022-07-19 10:52:06,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:52:06,855 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 14 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:06,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 337 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:52:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-19 10:52:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2022-07-19 10:52:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 202 states have (on average 1.2376237623762376) internal successors, (250), 212 states have internal predecessors, (250), 49 states have call successors, (49), 7 states have call predecessors, (49), 18 states have return successors, (198), 50 states have call predecessors, (198), 47 states have call successors, (198) [2022-07-19 10:52:06,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 497 transitions. [2022-07-19 10:52:06,880 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 497 transitions. Word has length 54 [2022-07-19 10:52:06,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:06,881 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 497 transitions. [2022-07-19 10:52:06,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:52:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 497 transitions. [2022-07-19 10:52:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-19 10:52:06,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:06,883 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:06,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-19 10:52:07,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 10:52:07,097 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:07,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:07,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1697379934, now seen corresponding path program 1 times [2022-07-19 10:52:07,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:07,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756882251] [2022-07-19 10:52:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:07,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:07,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:07,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 10:52:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:07,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:52:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:07,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 10:52:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:52:07,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:07,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756882251] [2022-07-19 10:52:07,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756882251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:07,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:07,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-19 10:52:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609087553] [2022-07-19 10:52:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:07,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 10:52:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:07,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 10:52:07,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:52:07,373 INFO L87 Difference]: Start difference. First operand 270 states and 497 transitions. Second operand has 18 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:52:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:08,611 INFO L93 Difference]: Finished difference Result 399 states and 828 transitions. [2022-07-19 10:52:08,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 10:52:08,611 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-07-19 10:52:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:08,614 INFO L225 Difference]: With dead ends: 399 [2022-07-19 10:52:08,614 INFO L226 Difference]: Without dead ends: 388 [2022-07-19 10:52:08,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2022-07-19 10:52:08,615 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 370 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2761 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:08,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 294 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2761 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 10:52:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-07-19 10:52:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 268. [2022-07-19 10:52:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 201 states have (on average 1.2388059701492538) internal successors, (249), 211 states have internal predecessors, (249), 48 states have call successors, (48), 7 states have call predecessors, (48), 18 states have return successors, (197), 49 states have call predecessors, (197), 46 states have call successors, (197) [2022-07-19 10:52:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 494 transitions. [2022-07-19 10:52:08,648 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 494 transitions. Word has length 55 [2022-07-19 10:52:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:08,648 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 494 transitions. [2022-07-19 10:52:08,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:52:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 494 transitions. [2022-07-19 10:52:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:08,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:08,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:08,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:52:08,650 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:08,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:08,650 INFO L85 PathProgramCache]: Analyzing trace with hash -954910152, now seen corresponding path program 1 times [2022-07-19 10:52:08,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:08,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366640492] [2022-07-19 10:52:08,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:08,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:08,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:08,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:08,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:52:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:08,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:08,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:08,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366640492] [2022-07-19 10:52:08,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366640492] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:08,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374630894] [2022-07-19 10:52:08,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:08,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:08,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:08,722 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-19 10:52:08,723 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-19 10:52:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:08,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:52:08,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:08,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:08,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374630894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:08,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:52:08,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-07-19 10:52:08,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30742629] [2022-07-19 10:52:08,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:08,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:52:08,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:08,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:52:08,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:52:08,871 INFO L87 Difference]: Start difference. First operand 268 states and 494 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:09,070 INFO L93 Difference]: Finished difference Result 713 states and 1469 transitions. [2022-07-19 10:52:09,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:52:09,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-19 10:52:09,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:09,074 INFO L225 Difference]: With dead ends: 713 [2022-07-19 10:52:09,074 INFO L226 Difference]: Without dead ends: 656 [2022-07-19 10:52:09,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:52:09,076 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 449 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:09,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1266 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:09,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-07-19 10:52:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 367. [2022-07-19 10:52:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 285 states have (on average 1.249122807017544) internal successors, (356), 299 states have internal predecessors, (356), 58 states have call successors, (58), 8 states have call predecessors, (58), 23 states have return successors, (212), 59 states have call predecessors, (212), 55 states have call successors, (212) [2022-07-19 10:52:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 626 transitions. [2022-07-19 10:52:09,124 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 626 transitions. Word has length 57 [2022-07-19 10:52:09,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:09,125 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 626 transitions. [2022-07-19 10:52:09,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 626 transitions. [2022-07-19 10:52:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:09,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:09,127 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:09,148 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-19 10:52:09,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 10:52:09,335 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1347937162, now seen corresponding path program 1 times [2022-07-19 10:52:09,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:09,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779488405] [2022-07-19 10:52:09,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:52:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:09,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:09,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779488405] [2022-07-19 10:52:09,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779488405] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:09,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980521817] [2022-07-19 10:52:09,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:09,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:09,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:09,400 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-19 10:52:09,401 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-19 10:52:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:52:09,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:09,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:09,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980521817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:09,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:52:09,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-19 10:52:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819721743] [2022-07-19 10:52:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:09,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:52:09,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:09,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:52:09,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:52:09,529 INFO L87 Difference]: Start difference. First operand 367 states and 626 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:09,716 INFO L93 Difference]: Finished difference Result 940 states and 1818 transitions. [2022-07-19 10:52:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:52:09,716 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-19 10:52:09,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:09,720 INFO L225 Difference]: With dead ends: 940 [2022-07-19 10:52:09,720 INFO L226 Difference]: Without dead ends: 759 [2022-07-19 10:52:09,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:52:09,721 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 393 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:09,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1059 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-07-19 10:52:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 429. [2022-07-19 10:52:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 334 states have (on average 1.251497005988024) internal successors, (418), 350 states have internal predecessors, (418), 68 states have call successors, (68), 9 states have call predecessors, (68), 26 states have return successors, (228), 69 states have call predecessors, (228), 64 states have call successors, (228) [2022-07-19 10:52:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 714 transitions. [2022-07-19 10:52:09,767 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 714 transitions. Word has length 57 [2022-07-19 10:52:09,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:09,767 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 714 transitions. [2022-07-19 10:52:09,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:09,768 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 714 transitions. [2022-07-19 10:52:09,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:09,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:09,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:09,786 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-19 10:52:09,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:09,983 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:09,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1088923658, now seen corresponding path program 1 times [2022-07-19 10:52:09,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:09,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775379709] [2022-07-19 10:52:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:52:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:10,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775379709] [2022-07-19 10:52:10,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775379709] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:10,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525541784] [2022-07-19 10:52:10,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:10,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:10,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:10,048 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-19 10:52:10,049 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-19 10:52:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:52:10,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:10,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:10,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525541784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:10,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:52:10,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-07-19 10:52:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668028333] [2022-07-19 10:52:10,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:10,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:52:10,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:10,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:52:10,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:52:10,186 INFO L87 Difference]: Start difference. First operand 429 states and 714 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:10,281 INFO L93 Difference]: Finished difference Result 567 states and 1019 transitions. [2022-07-19 10:52:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:52:10,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-19 10:52:10,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:10,284 INFO L225 Difference]: With dead ends: 567 [2022-07-19 10:52:10,284 INFO L226 Difference]: Without dead ends: 476 [2022-07-19 10:52:10,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:52:10,285 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 52 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:10,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:52:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-07-19 10:52:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 353. [2022-07-19 10:52:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 274 states have (on average 1.2664233576642336) internal successors, (347), 288 states have internal predecessors, (347), 57 states have call successors, (57), 6 states have call predecessors, (57), 21 states have return successors, (205), 58 states have call predecessors, (205), 54 states have call successors, (205) [2022-07-19 10:52:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 609 transitions. [2022-07-19 10:52:10,318 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 609 transitions. Word has length 57 [2022-07-19 10:52:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:10,318 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 609 transitions. [2022-07-19 10:52:10,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 609 transitions. [2022-07-19 10:52:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:10,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:10,320 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:10,347 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-19 10:52:10,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:10,539 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:10,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:10,539 INFO L85 PathProgramCache]: Analyzing trace with hash 998579127, now seen corresponding path program 2 times [2022-07-19 10:52:10,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:10,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037093987] [2022-07-19 10:52:10,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:52:10,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:10,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037093987] [2022-07-19 10:52:10,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037093987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:10,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:10,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:52:10,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752378448] [2022-07-19 10:52:10,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:10,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:10,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:10,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:10,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:10,596 INFO L87 Difference]: Start difference. First operand 353 states and 609 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:11,071 INFO L93 Difference]: Finished difference Result 797 states and 1470 transitions. [2022-07-19 10:52:11,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:52:11,071 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2022-07-19 10:52:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:11,073 INFO L225 Difference]: With dead ends: 797 [2022-07-19 10:52:11,073 INFO L226 Difference]: Without dead ends: 548 [2022-07-19 10:52:11,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:52:11,077 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 436 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:11,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 583 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:52:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-19 10:52:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 454. [2022-07-19 10:52:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 365 states have (on average 1.2465753424657535) internal successors, (455), 382 states have internal predecessors, (455), 62 states have call successors, (62), 8 states have call predecessors, (62), 26 states have return successors, (197), 63 states have call predecessors, (197), 59 states have call successors, (197) [2022-07-19 10:52:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 714 transitions. [2022-07-19 10:52:11,116 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 714 transitions. Word has length 57 [2022-07-19 10:52:11,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:11,116 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 714 transitions. [2022-07-19 10:52:11,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 714 transitions. [2022-07-19 10:52:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:11,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:11,120 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:11,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 10:52:11,120 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:11,121 INFO L85 PathProgramCache]: Analyzing trace with hash -12538123, now seen corresponding path program 1 times [2022-07-19 10:52:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:11,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946491733] [2022-07-19 10:52:11,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:11,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:52:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:11,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946491733] [2022-07-19 10:52:11,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946491733] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:11,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991894880] [2022-07-19 10:52:11,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:11,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:11,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:11,184 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:11,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 10:52:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 10:52:11,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:52:11,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:52:11,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991894880] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:11,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:11,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11, 10] total 12 [2022-07-19 10:52:11,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654026904] [2022-07-19 10:52:11,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:11,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:52:11,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:11,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:52:11,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:52:11,327 INFO L87 Difference]: Start difference. First operand 454 states and 714 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:11,363 INFO L93 Difference]: Finished difference Result 773 states and 1335 transitions. [2022-07-19 10:52:11,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:52:11,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2022-07-19 10:52:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:11,366 INFO L225 Difference]: With dead ends: 773 [2022-07-19 10:52:11,366 INFO L226 Difference]: Without dead ends: 474 [2022-07-19 10:52:11,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:52:11,369 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:11,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:52:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-19 10:52:11,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-07-19 10:52:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 385 states have (on average 1.2285714285714286) internal successors, (473), 402 states have internal predecessors, (473), 62 states have call successors, (62), 8 states have call predecessors, (62), 26 states have return successors, (197), 63 states have call predecessors, (197), 59 states have call successors, (197) [2022-07-19 10:52:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 732 transitions. [2022-07-19 10:52:11,406 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 732 transitions. Word has length 57 [2022-07-19 10:52:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:11,407 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 732 transitions. [2022-07-19 10:52:11,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 732 transitions. [2022-07-19 10:52:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:11,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:11,409 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:11,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:11,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-19 10:52:11,620 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:11,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:11,620 INFO L85 PathProgramCache]: Analyzing trace with hash -10691081, now seen corresponding path program 1 times [2022-07-19 10:52:11,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:11,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912026240] [2022-07-19 10:52:11,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:11,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:52:11,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:11,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912026240] [2022-07-19 10:52:11,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912026240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:11,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:11,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 10:52:11,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584946025] [2022-07-19 10:52:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:11,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 10:52:11,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:11,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 10:52:11,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:52:11,807 INFO L87 Difference]: Start difference. First operand 474 states and 732 transitions. Second operand has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:12,361 INFO L93 Difference]: Finished difference Result 801 states and 1155 transitions. [2022-07-19 10:52:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:52:12,361 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2022-07-19 10:52:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:12,364 INFO L225 Difference]: With dead ends: 801 [2022-07-19 10:52:12,364 INFO L226 Difference]: Without dead ends: 608 [2022-07-19 10:52:12,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:52:12,365 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 276 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:12,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 844 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:52:12,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-19 10:52:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 568. [2022-07-19 10:52:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 467 states have (on average 1.2098501070663812) internal successors, (565), 486 states have internal predecessors, (565), 69 states have call successors, (69), 11 states have call predecessors, (69), 31 states have return successors, (200), 70 states have call predecessors, (200), 66 states have call successors, (200) [2022-07-19 10:52:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 834 transitions. [2022-07-19 10:52:12,428 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 834 transitions. Word has length 57 [2022-07-19 10:52:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:12,428 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 834 transitions. [2022-07-19 10:52:12,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 834 transitions. [2022-07-19 10:52:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 10:52:12,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:12,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:12,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 10:52:12,430 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:12,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:12,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1534810419, now seen corresponding path program 1 times [2022-07-19 10:52:12,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:12,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459503137] [2022-07-19 10:52:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:12,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 10:52:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 10:52:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 10:52:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:52:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:12,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459503137] [2022-07-19 10:52:12,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459503137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:12,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057475144] [2022-07-19 10:52:12,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:12,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:12,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:12,516 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:12,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 10:52:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-19 10:52:12,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:52:12,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:52:12,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057475144] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:12,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:12,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-07-19 10:52:12,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740808382] [2022-07-19 10:52:12,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:12,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 10:52:12,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:12,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 10:52:12,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:52:12,825 INFO L87 Difference]: Start difference. First operand 568 states and 834 transitions. Second operand has 23 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 5 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 10:52:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:15,406 INFO L93 Difference]: Finished difference Result 924 states and 1487 transitions. [2022-07-19 10:52:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-19 10:52:15,407 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 5 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 59 [2022-07-19 10:52:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:15,410 INFO L225 Difference]: With dead ends: 924 [2022-07-19 10:52:15,410 INFO L226 Difference]: Without dead ends: 791 [2022-07-19 10:52:15,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=484, Invalid=2596, Unknown=0, NotChecked=0, Total=3080 [2022-07-19 10:52:15,412 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 557 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 4812 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 4958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 4812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:15,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 581 Invalid, 4958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 4812 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-19 10:52:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-07-19 10:52:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 564. [2022-07-19 10:52:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 465 states have (on average 1.206451612903226) internal successors, (561), 484 states have internal predecessors, (561), 67 states have call successors, (67), 11 states have call predecessors, (67), 31 states have return successors, (190), 68 states have call predecessors, (190), 64 states have call successors, (190) [2022-07-19 10:52:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 818 transitions. [2022-07-19 10:52:15,465 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 818 transitions. Word has length 59 [2022-07-19 10:52:15,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:15,465 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 818 transitions. [2022-07-19 10:52:15,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 5 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 10:52:15,465 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 818 transitions. [2022-07-19 10:52:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:52:15,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:15,467 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:15,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:15,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:15,681 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:15,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:15,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1198827729, now seen corresponding path program 1 times [2022-07-19 10:52:15,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:15,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844249636] [2022-07-19 10:52:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:15,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 10:52:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 10:52:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:52:15,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:15,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844249636] [2022-07-19 10:52:15,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844249636] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:15,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836267179] [2022-07-19 10:52:15,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:15,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:15,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:15,773 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:15,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 10:52:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 10:52:15,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-19 10:52:15,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-19 10:52:15,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836267179] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:15,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:15,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-07-19 10:52:15,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807573330] [2022-07-19 10:52:15,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:15,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:52:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:15,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:52:15,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:52:15,983 INFO L87 Difference]: Start difference. First operand 564 states and 818 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 10:52:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:17,652 INFO L93 Difference]: Finished difference Result 1164 states and 1757 transitions. [2022-07-19 10:52:17,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 10:52:17,652 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 60 [2022-07-19 10:52:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:17,655 INFO L225 Difference]: With dead ends: 1164 [2022-07-19 10:52:17,655 INFO L226 Difference]: Without dead ends: 869 [2022-07-19 10:52:17,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=1173, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 10:52:17,660 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 949 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 3054 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 3054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:17,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 538 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 3054 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 10:52:17,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-07-19 10:52:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 644. [2022-07-19 10:52:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 538 states have (on average 1.1988847583643123) internal successors, (645), 560 states have internal predecessors, (645), 69 states have call successors, (69), 13 states have call predecessors, (69), 36 states have return successors, (158), 70 states have call predecessors, (158), 66 states have call successors, (158) [2022-07-19 10:52:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 872 transitions. [2022-07-19 10:52:17,725 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 872 transitions. Word has length 60 [2022-07-19 10:52:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:17,726 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 872 transitions. [2022-07-19 10:52:17,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 10:52:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 872 transitions. [2022-07-19 10:52:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-19 10:52:17,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:17,729 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:17,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:17,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:17,939 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:17,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:17,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1214292501, now seen corresponding path program 1 times [2022-07-19 10:52:17,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:17,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166193891] [2022-07-19 10:52:17,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:17,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:17,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:52:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:18,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:52:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:18,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166193891] [2022-07-19 10:52:18,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166193891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:18,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929720729] [2022-07-19 10:52:18,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:18,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:18,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:18,007 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:18,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-19 10:52:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:18,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:52:18,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:18,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:18,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929720729] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:18,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:18,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-07-19 10:52:18,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804680696] [2022-07-19 10:52:18,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:18,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:52:18,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:18,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:52:18,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:52:18,199 INFO L87 Difference]: Start difference. First operand 644 states and 872 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:52:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:19,309 INFO L93 Difference]: Finished difference Result 1351 states and 1983 transitions. [2022-07-19 10:52:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:52:19,309 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2022-07-19 10:52:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:19,313 INFO L225 Difference]: With dead ends: 1351 [2022-07-19 10:52:19,313 INFO L226 Difference]: Without dead ends: 1128 [2022-07-19 10:52:19,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2022-07-19 10:52:19,314 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 319 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 2661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:19,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 431 Invalid, 2661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 10:52:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2022-07-19 10:52:19,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 617. [2022-07-19 10:52:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 519 states have (on average 1.2023121387283238) internal successors, (624), 539 states have internal predecessors, (624), 65 states have call successors, (65), 11 states have call predecessors, (65), 32 states have return successors, (148), 66 states have call predecessors, (148), 62 states have call successors, (148) [2022-07-19 10:52:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 837 transitions. [2022-07-19 10:52:19,379 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 837 transitions. Word has length 61 [2022-07-19 10:52:19,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:19,379 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 837 transitions. [2022-07-19 10:52:19,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:52:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 837 transitions. [2022-07-19 10:52:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:52:19,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:19,381 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:19,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-19 10:52:19,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-19 10:52:19,598 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:19,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:19,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1453926245, now seen corresponding path program 1 times [2022-07-19 10:52:19,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:19,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184992387] [2022-07-19 10:52:19,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:19,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:19,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:19,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:19,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:19,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184992387] [2022-07-19 10:52:19,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184992387] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:19,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740649461] [2022-07-19 10:52:19,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:19,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:19,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:19,669 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:19,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-19 10:52:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:19,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:52:19,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:19,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:19,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740649461] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:19,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:19,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-07-19 10:52:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317122492] [2022-07-19 10:52:19,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:19,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:19,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:19,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:19,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:19,792 INFO L87 Difference]: Start difference. First operand 617 states and 837 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:20,345 INFO L93 Difference]: Finished difference Result 1077 states and 1470 transitions. [2022-07-19 10:52:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 10:52:20,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2022-07-19 10:52:20,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:20,348 INFO L225 Difference]: With dead ends: 1077 [2022-07-19 10:52:20,348 INFO L226 Difference]: Without dead ends: 779 [2022-07-19 10:52:20,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:52:20,350 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 306 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:20,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 636 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:52:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-07-19 10:52:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 610. [2022-07-19 10:52:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 511 states have (on average 1.2015655577299413) internal successors, (614), 532 states have internal predecessors, (614), 65 states have call successors, (65), 11 states have call predecessors, (65), 33 states have return successors, (147), 66 states have call predecessors, (147), 62 states have call successors, (147) [2022-07-19 10:52:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 826 transitions. [2022-07-19 10:52:20,408 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 826 transitions. Word has length 60 [2022-07-19 10:52:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:20,408 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 826 transitions. [2022-07-19 10:52:20,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 826 transitions. [2022-07-19 10:52:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:52:20,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:20,411 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:20,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:20,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-19 10:52:20,623 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:20,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2131752737, now seen corresponding path program 1 times [2022-07-19 10:52:20,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:20,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739769380] [2022-07-19 10:52:20,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:20,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:20,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:20,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:20,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:20,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:20,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739769380] [2022-07-19 10:52:20,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739769380] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:20,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422769] [2022-07-19 10:52:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:20,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:20,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:20,680 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:20,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-19 10:52:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:20,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 10:52:20,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 10:52:20,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 10:52:20,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422769] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:20,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:20,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-07-19 10:52:20,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039077948] [2022-07-19 10:52:20,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:20,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:52:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:20,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:52:20,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:52:20,946 INFO L87 Difference]: Start difference. First operand 610 states and 826 transitions. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:22,058 INFO L93 Difference]: Finished difference Result 1342 states and 1932 transitions. [2022-07-19 10:52:22,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-19 10:52:22,058 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2022-07-19 10:52:22,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:22,061 INFO L225 Difference]: With dead ends: 1342 [2022-07-19 10:52:22,062 INFO L226 Difference]: Without dead ends: 968 [2022-07-19 10:52:22,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=1302, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 10:52:22,064 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 449 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:22,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 601 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 10:52:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-07-19 10:52:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 698. [2022-07-19 10:52:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 589 states have (on average 1.1901528013582343) internal successors, (701), 615 states have internal predecessors, (701), 68 states have call successors, (68), 13 states have call predecessors, (68), 40 states have return successors, (159), 69 states have call predecessors, (159), 65 states have call successors, (159) [2022-07-19 10:52:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 928 transitions. [2022-07-19 10:52:22,131 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 928 transitions. Word has length 60 [2022-07-19 10:52:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:22,131 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 928 transitions. [2022-07-19 10:52:22,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 928 transitions. [2022-07-19 10:52:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:52:22,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:22,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:22,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:22,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-19 10:52:22,351 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:22,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:22,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1940152897, now seen corresponding path program 1 times [2022-07-19 10:52:22,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:22,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444641913] [2022-07-19 10:52:22,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:22,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:22,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:22,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:22,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:22,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:22,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444641913] [2022-07-19 10:52:22,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444641913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:22,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:22,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 10:52:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745950457] [2022-07-19 10:52:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:22,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 10:52:22,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 10:52:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:52:22,422 INFO L87 Difference]: Start difference. First operand 698 states and 928 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:23,398 INFO L93 Difference]: Finished difference Result 1624 states and 2442 transitions. [2022-07-19 10:52:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:52:23,398 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2022-07-19 10:52:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:23,403 INFO L225 Difference]: With dead ends: 1624 [2022-07-19 10:52:23,403 INFO L226 Difference]: Without dead ends: 1444 [2022-07-19 10:52:23,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2022-07-19 10:52:23,404 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 323 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:23,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 813 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 10:52:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-07-19 10:52:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 889. [2022-07-19 10:52:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 756 states have (on average 1.1957671957671958) internal successors, (904), 789 states have internal predecessors, (904), 82 states have call successors, (82), 16 states have call predecessors, (82), 50 states have return successors, (188), 83 states have call predecessors, (188), 79 states have call successors, (188) [2022-07-19 10:52:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1174 transitions. [2022-07-19 10:52:23,511 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1174 transitions. Word has length 60 [2022-07-19 10:52:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:23,511 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1174 transitions. [2022-07-19 10:52:23,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1174 transitions. [2022-07-19 10:52:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:52:23,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:23,513 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:23,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 10:52:23,513 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:23,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1676987907, now seen corresponding path program 1 times [2022-07-19 10:52:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:23,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454759601] [2022-07-19 10:52:23,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:23,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:23,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:23,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:23,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454759601] [2022-07-19 10:52:23,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454759601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:23,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:23,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:52:23,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185933386] [2022-07-19 10:52:23,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:23,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:23,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:23,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:23,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:23,580 INFO L87 Difference]: Start difference. First operand 889 states and 1174 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:24,311 INFO L93 Difference]: Finished difference Result 1900 states and 2818 transitions. [2022-07-19 10:52:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:52:24,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2022-07-19 10:52:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:24,319 INFO L225 Difference]: With dead ends: 1900 [2022-07-19 10:52:24,319 INFO L226 Difference]: Without dead ends: 1583 [2022-07-19 10:52:24,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:52:24,323 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 577 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:24,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 569 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:52:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-07-19 10:52:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 996. [2022-07-19 10:52:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 845 states have (on average 1.1940828402366863) internal successors, (1009), 884 states have internal predecessors, (1009), 92 states have call successors, (92), 18 states have call predecessors, (92), 58 states have return successors, (210), 93 states have call predecessors, (210), 89 states have call successors, (210) [2022-07-19 10:52:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1311 transitions. [2022-07-19 10:52:24,437 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1311 transitions. Word has length 60 [2022-07-19 10:52:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:24,437 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1311 transitions. [2022-07-19 10:52:24,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1311 transitions. [2022-07-19 10:52:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:52:24,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:24,439 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:24,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 10:52:24,439 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:24,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2074166403, now seen corresponding path program 2 times [2022-07-19 10:52:24,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:24,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513065209] [2022-07-19 10:52:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:24,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:24,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:24,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:24,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:24,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513065209] [2022-07-19 10:52:24,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513065209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:24,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:24,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:52:24,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829263921] [2022-07-19 10:52:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:24,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:24,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:24,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:24,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:24,490 INFO L87 Difference]: Start difference. First operand 996 states and 1311 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:24,989 INFO L93 Difference]: Finished difference Result 1368 states and 1904 transitions. [2022-07-19 10:52:24,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 10:52:24,990 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2022-07-19 10:52:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:24,993 INFO L225 Difference]: With dead ends: 1368 [2022-07-19 10:52:24,993 INFO L226 Difference]: Without dead ends: 1143 [2022-07-19 10:52:24,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:52:24,995 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 180 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:24,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 646 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:52:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-07-19 10:52:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 905. [2022-07-19 10:52:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 765 states have (on average 1.188235294117647) internal successors, (909), 800 states have internal predecessors, (909), 85 states have call successors, (85), 18 states have call predecessors, (85), 54 states have return successors, (194), 86 states have call predecessors, (194), 82 states have call successors, (194) [2022-07-19 10:52:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1188 transitions. [2022-07-19 10:52:25,095 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1188 transitions. Word has length 60 [2022-07-19 10:52:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:25,095 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1188 transitions. [2022-07-19 10:52:25,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1188 transitions. [2022-07-19 10:52:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 10:52:25,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:25,097 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:25,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-19 10:52:25,097 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:25,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:25,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1963615586, now seen corresponding path program 1 times [2022-07-19 10:52:25,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:25,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8062] [2022-07-19 10:52:25,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:25,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:52:25,115 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 10:52:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:52:25,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 10:52:25,151 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 10:52:25,151 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:52:25,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 10:52:25,155 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:25,157 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:52:25,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:52:25 BoogieIcfgContainer [2022-07-19 10:52:25,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:52:25,216 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:52:25,216 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:52:25,216 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:52:25,217 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:51:34" (3/4) ... [2022-07-19 10:52:25,219 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 10:52:25,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:52:25,219 INFO L158 Benchmark]: Toolchain (without parser) took 51791.17ms. Allocated memory was 109.1MB in the beginning and 264.2MB in the end (delta: 155.2MB). Free memory was 69.5MB in the beginning and 152.1MB in the end (delta: -82.6MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2022-07-19 10:52:25,219 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory was 87.1MB in the beginning and 87.1MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:52:25,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.70ms. Allocated memory is still 109.1MB. Free memory was 69.2MB in the beginning and 56.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 10:52:25,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.01ms. Allocated memory is still 109.1MB. Free memory was 56.0MB in the beginning and 87.3MB in the end (delta: -31.3MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2022-07-19 10:52:25,222 INFO L158 Benchmark]: Boogie Preprocessor took 42.02ms. Allocated memory is still 109.1MB. Free memory was 87.3MB in the beginning and 85.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:52:25,223 INFO L158 Benchmark]: RCFGBuilder took 367.61ms. Allocated memory is still 109.1MB. Free memory was 85.5MB in the beginning and 68.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 10:52:25,226 INFO L158 Benchmark]: TraceAbstraction took 51084.61ms. Allocated memory was 109.1MB in the beginning and 264.2MB in the end (delta: 155.2MB). Free memory was 67.7MB in the beginning and 152.1MB in the end (delta: -84.3MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2022-07-19 10:52:25,226 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 264.2MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:52:25,228 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.20ms. Allocated memory is still 109.1MB. Free memory was 87.1MB in the beginning and 87.1MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.70ms. Allocated memory is still 109.1MB. Free memory was 69.2MB in the beginning and 56.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.01ms. Allocated memory is still 109.1MB. Free memory was 56.0MB in the beginning and 87.3MB in the end (delta: -31.3MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.02ms. Allocated memory is still 109.1MB. Free memory was 87.3MB in the beginning and 85.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 367.61ms. Allocated memory is still 109.1MB. Free memory was 85.5MB in the beginning and 68.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 51084.61ms. Allocated memory was 109.1MB in the beginning and 264.2MB in the end (delta: 155.2MB). Free memory was 67.7MB in the beginning and 152.1MB in the end (delta: -84.3MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 264.2MB. Free memory is still 152.1MB. 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: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=-125, eb=127] [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=0, m=0, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L241] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-125, eb=127, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L29] COND FALSE !(! m) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L57] COND TRUE 1 VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=0, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=0, m = m & ~ (1U << 24U)=8573157378, res=4278190080, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L78] __retres4 = res VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, __retres4=4278190080, e=-125, m=0, m = m & ~ (1U << 24U)=8573157378, res=4278190080, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, \result=8573157376, __retres4=4278190080, e=-125, m=0, m = m & ~ (1U << 24U)=8573157378, res=4278190080, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L242] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=8573157376, ea=-125, eb=127, m = m & ~ (1U << 24U)=8573157378, ma=16777216, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, \result=4294967295, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L243] RET, EXPR base2flt(mb, eb) VAL [a=4278190080, base2flt(mb, eb)=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=8573157378, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=8573157379, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4278190080, b=4294967295, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=8573157379, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=8573157379, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L101] COND FALSE !(! b) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=8573157379, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, m = m & ~ (1U << 24U)=8573157378, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, m = m & ~ (1U << 24U)=8573157378, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L110] ma = ma | (1U << 24U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, m = m & ~ (1U << 24U)=8573157378, ma=4278190084, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L111] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, m = m & ~ (1U << 24U)=8573157378, ma=4278190084, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, eb=383, m = m & ~ (1U << 24U)=8573157378, ma=4278190084, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L113] mb = mb | (1U << 24U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, eb=383, m = m & ~ (1U << 24U)=8573157378, ma=4278190084, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb=4278190090, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, cond=0, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L17] reach_error() VAL [\old(cond)=0, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, cond=0, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.0s, OverallIterations: 32, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 37.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12632 SdHoareTripleChecker+Valid, 26.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12343 mSDsluCounter, 17541 SdHoareTripleChecker+Invalid, 21.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11879 mSDsCounter, 2404 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69559 IncrementalHoareTripleChecker+Invalid, 71963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2404 mSolverCounterUnsat, 5662 mSDtfsCounter, 69559 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2804 GetRequests, 1890 SyntacticMatches, 17 SemanticMatches, 897 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6959 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=996occurred in iteration=30, InterpolantAutomatonStates: 642, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 5797 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2691 NumberOfCodeBlocks, 2691 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3322 ConstructedInterpolants, 0 QuantifiedInterpolants, 8595 SizeOfPredicates, 95 NumberOfNonLiveVariables, 3982 ConjunctsInSsa, 292 ConjunctsInUnsatCore, 63 InterpolantComputations, 18 PerfectInterpolantSequences, 1034/1247 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-19 10:52:25,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:52:26,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:52:26,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:52:26,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:52:26,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:52:26,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:52:26,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:52:26,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:52:26,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:52:26,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:52:26,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:52:26,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:52:26,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:52:26,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:52:26,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:52:26,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:52:26,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:52:26,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:52:26,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:52:26,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:52:26,968 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:52:26,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:52:26,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:52:26,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:52:26,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:52:26,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:52:26,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:52:26,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:52:26,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:52:26,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:52:26,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:52:26,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:52:26,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:52:26,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:52:26,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:52:26,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:52:26,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:52:26,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:52:26,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:52:26,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:52:26,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:52:26,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:52:26,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 10:52:27,010 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:52:27,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:52:27,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:52:27,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:52:27,011 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:52:27,011 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:52:27,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:52:27,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:52:27,012 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:52:27,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:52:27,012 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:52:27,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:52:27,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:52:27,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:52:27,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:52:27,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:52:27,012 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 10:52:27,012 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 10:52:27,012 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 10:52:27,013 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:52:27,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:52:27,013 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:52:27,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:52:27,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:52:27,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:52:27,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:52:27,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:52:27,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:52:27,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:52:27,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:52:27,013 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 10:52:27,014 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 10:52:27,014 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:52:27,014 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:52:27,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:52:27,014 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 10:52:27,014 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2022-07-19 10:52:27,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:52:27,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:52:27,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:52:27,279 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:52:27,280 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:52:27,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-19 10:52:27,327 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b538c5c/32271953bdbc4e95a05f37f31a9b59ee/FLAG7c8028f36 [2022-07-19 10:52:27,703 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:52:27,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-19 10:52:27,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b538c5c/32271953bdbc4e95a05f37f31a9b59ee/FLAG7c8028f36 [2022-07-19 10:52:27,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b538c5c/32271953bdbc4e95a05f37f31a9b59ee [2022-07-19 10:52:27,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:52:27,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:52:27,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:52:27,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:52:27,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:52:27,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:52:27" (1/1) ... [2022-07-19 10:52:27,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3355ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:27, skipping insertion in model container [2022-07-19 10:52:27,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:52:27" (1/1) ... [2022-07-19 10:52:27,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:52:27,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:52:27,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2022-07-19 10:52:27,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:52:27,958 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:52:27,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2022-07-19 10:52:28,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:52:28,022 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:52:28,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:28 WrapperNode [2022-07-19 10:52:28,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:52:28,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:52:28,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:52:28,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:52:28,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:28" (1/1) ... [2022-07-19 10:52:28,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:28" (1/1) ... [2022-07-19 10:52:28,057 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2022-07-19 10:52:28,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:52:28,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:52:28,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:52:28,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:52:28,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:28" (1/1) ... [2022-07-19 10:52:28,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:28" (1/1) ... [2022-07-19 10:52:28,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:28" (1/1) ... [2022-07-19 10:52:28,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:28" (1/1) ... [2022-07-19 10:52:28,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:28" (1/1) ... [2022-07-19 10:52:28,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:28" (1/1) ... [2022-07-19 10:52:28,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:28" (1/1) ... [2022-07-19 10:52:28,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:52:28,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:52:28,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:52:28,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:52:28,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:28" (1/1) ... [2022-07-19 10:52:28,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:52:28,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:28,119 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-19 10:52:28,127 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-19 10:52:28,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:52:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 10:52:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-19 10:52:28,145 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-19 10:52:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:52:28,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:52:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-19 10:52:28,145 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-19 10:52:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 10:52:28,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 10:52:28,197 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:52:28,198 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:52:28,381 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:52:28,385 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:52:28,385 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 10:52:28,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:52:28 BoogieIcfgContainer [2022-07-19 10:52:28,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:52:28,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:52:28,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:52:28,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:52:28,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:52:27" (1/3) ... [2022-07-19 10:52:28,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794f9d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:52:28, skipping insertion in model container [2022-07-19 10:52:28,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:28" (2/3) ... [2022-07-19 10:52:28,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794f9d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:52:28, skipping insertion in model container [2022-07-19 10:52:28,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:52:28" (3/3) ... [2022-07-19 10:52:28,413 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-07-19 10:52:28,422 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:52:28,422 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:52:28,514 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:52:28,520 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@43b51176, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@469e75b3 [2022-07-19 10:52:28,520 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:52:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-19 10:52:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 10:52:28,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:28,530 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:28,531 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:28,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:28,535 INFO L85 PathProgramCache]: Analyzing trace with hash 173410466, now seen corresponding path program 1 times [2022-07-19 10:52:28,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:28,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426982199] [2022-07-19 10:52:28,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:28,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:28,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:28,546 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-19 10:52:28,547 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-19 10:52:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:28,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 10:52:28,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:28,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:28,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:28,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426982199] [2022-07-19 10:52:28,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426982199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:28,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:28,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:52:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203413319] [2022-07-19 10:52:28,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:28,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:52:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:28,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:52:28,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:52:28,758 INFO L87 Difference]: Start difference. First operand has 54 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:28,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:28,893 INFO L93 Difference]: Finished difference Result 130 states and 196 transitions. [2022-07-19 10:52:28,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:52:28,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-07-19 10:52:28,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:28,901 INFO L225 Difference]: With dead ends: 130 [2022-07-19 10:52:28,902 INFO L226 Difference]: Without dead ends: 71 [2022-07-19 10:52:28,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:52:28,909 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:28,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 459 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-19 10:52:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2022-07-19 10:52:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 47 states have internal predecessors, (59), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-19 10:52:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-07-19 10:52:28,953 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 31 [2022-07-19 10:52:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:28,954 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-07-19 10:52:28,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-07-19 10:52:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 10:52:28,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:28,957 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:28,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:29,163 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-19 10:52:29,164 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1707598935, now seen corresponding path program 1 times [2022-07-19 10:52:29,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:29,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760055596] [2022-07-19 10:52:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:29,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:29,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:29,181 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-19 10:52:29,182 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-19 10:52:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:29,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:52:29,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:29,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:29,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:29,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760055596] [2022-07-19 10:52:29,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760055596] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:29,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:29,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-07-19 10:52:29,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882850629] [2022-07-19 10:52:29,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:29,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:52:29,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:29,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:52:29,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:52:29,325 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:29,410 INFO L93 Difference]: Finished difference Result 121 states and 161 transitions. [2022-07-19 10:52:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:52:29,411 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-07-19 10:52:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:29,412 INFO L225 Difference]: With dead ends: 121 [2022-07-19 10:52:29,412 INFO L226 Difference]: Without dead ends: 93 [2022-07-19 10:52:29,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:52:29,413 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 26 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:29,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 492 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:52:29,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-19 10:52:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2022-07-19 10:52:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 54 states have internal predecessors, (67), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-19 10:52:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2022-07-19 10:52:29,422 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 35 [2022-07-19 10:52:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:29,422 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2022-07-19 10:52:29,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2022-07-19 10:52:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 10:52:29,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:29,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:29,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-19 10:52:29,627 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-19 10:52:29,628 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1508244029, now seen corresponding path program 1 times [2022-07-19 10:52:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:29,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180206379] [2022-07-19 10:52:29,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:29,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:29,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:29,630 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-19 10:52:29,631 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-19 10:52:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:29,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 10:52:29,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:29,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:29,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:29,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180206379] [2022-07-19 10:52:29,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180206379] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:29,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:29,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-19 10:52:29,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096491326] [2022-07-19 10:52:29,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:29,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:52:29,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:29,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:52:29,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:52:29,788 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:29,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:29,851 INFO L93 Difference]: Finished difference Result 113 states and 150 transitions. [2022-07-19 10:52:29,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:52:29,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-07-19 10:52:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:29,853 INFO L225 Difference]: With dead ends: 113 [2022-07-19 10:52:29,853 INFO L226 Difference]: Without dead ends: 89 [2022-07-19 10:52:29,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:52:29,854 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 16 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:29,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 455 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:52:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-19 10:52:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2022-07-19 10:52:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 61 states have internal predecessors, (74), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2022-07-19 10:52:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2022-07-19 10:52:29,861 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 39 [2022-07-19 10:52:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:29,861 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2022-07-19 10:52:29,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-07-19 10:52:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 10:52:29,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:29,862 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:29,870 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-19 10:52:30,065 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-19 10:52:30,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:30,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:30,066 INFO L85 PathProgramCache]: Analyzing trace with hash -54729342, now seen corresponding path program 2 times [2022-07-19 10:52:30,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:30,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989864088] [2022-07-19 10:52:30,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:52:30,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:30,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:30,068 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-19 10:52:30,069 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-19 10:52:30,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 10:52:30,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:52:30,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:52:30,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:52:30,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:30,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:30,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989864088] [2022-07-19 10:52:30,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989864088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:30,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:30,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:52:30,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152228313] [2022-07-19 10:52:30,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:30,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:52:30,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:30,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:52:30,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:52:30,188 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:30,233 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2022-07-19 10:52:30,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:52:30,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-07-19 10:52:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:30,234 INFO L225 Difference]: With dead ends: 96 [2022-07-19 10:52:30,235 INFO L226 Difference]: Without dead ends: 94 [2022-07-19 10:52:30,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:52:30,235 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 9 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:30,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 337 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-19 10:52:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-19 10:52:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2022-07-19 10:52:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.253968253968254) internal successors, (79), 66 states have internal predecessors, (79), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2022-07-19 10:52:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2022-07-19 10:52:30,254 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 39 [2022-07-19 10:52:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:30,254 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2022-07-19 10:52:30,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-07-19 10:52:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 10:52:30,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:30,256 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:30,264 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-19 10:52:30,460 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-19 10:52:30,460 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:30,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2528960, now seen corresponding path program 1 times [2022-07-19 10:52:30,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:30,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813240838] [2022-07-19 10:52:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:30,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:30,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:30,462 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-19 10:52:30,464 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-19 10:52:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:30,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:52:30,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:52:30,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:30,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:30,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813240838] [2022-07-19 10:52:30,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813240838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:30,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:30,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:52:30,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62225799] [2022-07-19 10:52:30,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:30,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:52:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:30,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:52:30,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:52:30,565 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:30,612 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-07-19 10:52:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:52:30,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-07-19 10:52:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:30,615 INFO L225 Difference]: With dead ends: 96 [2022-07-19 10:52:30,615 INFO L226 Difference]: Without dead ends: 94 [2022-07-19 10:52:30,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:52:30,616 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 9 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:30,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 308 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-07-19 10:52:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-19 10:52:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-07-19 10:52:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 64 states have internal predecessors, (77), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2022-07-19 10:52:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2022-07-19 10:52:30,627 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 39 [2022-07-19 10:52:30,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:30,628 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2022-07-19 10:52:30,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2022-07-19 10:52:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:52:30,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:30,634 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:30,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-19 10:52:30,840 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-19 10:52:30,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:30,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1837968146, now seen corresponding path program 1 times [2022-07-19 10:52:30,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:30,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874218399] [2022-07-19 10:52:30,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:30,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:30,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:30,844 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-19 10:52:30,845 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-19 10:52:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:30,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 10:52:30,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:52:30,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:30,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:30,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874218399] [2022-07-19 10:52:30,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874218399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:30,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:30,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:52:30,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926405958] [2022-07-19 10:52:30,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:30,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:30,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:30,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:30,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:30,960 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:52:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:31,140 INFO L93 Difference]: Finished difference Result 126 states and 165 transitions. [2022-07-19 10:52:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:52:31,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-07-19 10:52:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:31,141 INFO L225 Difference]: With dead ends: 126 [2022-07-19 10:52:31,141 INFO L226 Difference]: Without dead ends: 119 [2022-07-19 10:52:31,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:52:31,142 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 33 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:31,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 661 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-19 10:52:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-07-19 10:52:31,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 74 states have internal predecessors, (89), 18 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-19 10:52:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-07-19 10:52:31,157 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 44 [2022-07-19 10:52:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:31,157 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-07-19 10:52:31,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:52:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-07-19 10:52:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 10:52:31,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:31,158 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:31,167 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-19 10:52:31,364 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-19 10:52:31,365 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:31,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:31,365 INFO L85 PathProgramCache]: Analyzing trace with hash 595859751, now seen corresponding path program 1 times [2022-07-19 10:52:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:31,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577930628] [2022-07-19 10:52:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:31,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:31,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:31,367 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-19 10:52:31,368 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-19 10:52:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:31,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:52:31,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 10:52:31,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:31,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:31,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577930628] [2022-07-19 10:52:31,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577930628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:31,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:31,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:52:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822041608] [2022-07-19 10:52:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:31,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:52:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:31,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:52:31,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:52:31,450 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:52:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:31,529 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2022-07-19 10:52:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:52:31,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2022-07-19 10:52:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:31,530 INFO L225 Difference]: With dead ends: 164 [2022-07-19 10:52:31,530 INFO L226 Difference]: Without dead ends: 127 [2022-07-19 10:52:31,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:52:31,531 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:31,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 518 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:52:31,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-19 10:52:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2022-07-19 10:52:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 81 states have internal predecessors, (95), 16 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2022-07-19 10:52:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2022-07-19 10:52:31,538 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 49 [2022-07-19 10:52:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:31,538 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2022-07-19 10:52:31,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:52:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2022-07-19 10:52:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:52:31,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:31,539 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:31,545 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-19 10:52:31,745 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-19 10:52:31,748 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1849173563, now seen corresponding path program 1 times [2022-07-19 10:52:31,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:31,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359810796] [2022-07-19 10:52:31,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:31,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:31,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:31,750 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-19 10:52:31,751 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-19 10:52:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:52:31,787 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 10:52:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:52:31,850 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-19 10:52:31,851 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 10:52:31,851 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:52:31,861 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-19 10:52:32,059 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-19 10:52:32,062 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:32,064 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:52:32,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:52:32 BoogieIcfgContainer [2022-07-19 10:52:32,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:52:32,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:52:32,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:52:32,087 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:52:32,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:52:28" (3/4) ... [2022-07-19 10:52:32,088 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 10:52:32,120 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 10:52:32,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:52:32,120 INFO L158 Benchmark]: Toolchain (without parser) took 4392.13ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 47.4MB in the beginning and 30.1MB in the end (delta: 17.3MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2022-07-19 10:52:32,120 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 67.1MB. Free memory was 48.3MB in the beginning and 48.3MB in the end (delta: 32.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:52:32,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.00ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 47.9MB in the end (delta: -757.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 10:52:32,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.80ms. Allocated memory is still 67.1MB. Free memory was 47.9MB in the beginning and 46.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:52:32,121 INFO L158 Benchmark]: Boogie Preprocessor took 26.34ms. Allocated memory is still 67.1MB. Free memory was 46.2MB in the beginning and 44.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:52:32,121 INFO L158 Benchmark]: RCFGBuilder took 301.02ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 32.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 10:52:32,122 INFO L158 Benchmark]: TraceAbstraction took 3686.17ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 32.0MB in the beginning and 32.8MB in the end (delta: -796.1kB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2022-07-19 10:52:32,122 INFO L158 Benchmark]: Witness Printer took 33.35ms. Allocated memory is still 81.8MB. Free memory was 32.8MB in the beginning and 30.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:52:32,123 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.22ms. Allocated memory is still 67.1MB. Free memory was 48.3MB in the beginning and 48.3MB in the end (delta: 32.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.00ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 47.9MB in the end (delta: -757.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.80ms. Allocated memory is still 67.1MB. Free memory was 47.9MB in the beginning and 46.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.34ms. Allocated memory is still 67.1MB. Free memory was 46.2MB in the beginning and 44.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 301.02ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 32.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3686.17ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 32.0MB in the beginning and 32.8MB in the end (delta: -796.1kB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Witness Printer took 33.35ms. Allocated memory is still 81.8MB. Free memory was 32.8MB in the beginning and 30.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L241] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=2147483648, e=0, m=0, res=2147483648] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-2147483648, __retres4=2147483648, e=0, m=0, res=2147483648] [L242] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=-2147483648, ea=0, ma=16777216, zero=0] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=3221225472, e=64, m=0, res=3221225472] [L80] return (__retres4); VAL [\old(e)=64, \old(m)=16777216, \result=-1073741824, __retres4=3221225472, e=64, m=0, res=3221225472] [L243] RET, EXPR base2flt(mb, eb) VAL [a=2147483648, base2flt(mb, eb)=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=2147483648, \old(b)=3221225472] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=2147483648, \old(b)=3221225472, a=2147483648, b=3221225472] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, tmp=2147483648] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L115] delta = ea - eb VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, delta=64, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 3230 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 26 IncrementalHoareTripleChecker+Unchecked, 2747 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 520 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 483 mSDtfsCounter, 520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 95 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 321 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 341 ConstructedInterpolants, 2 QuantifiedInterpolants, 537 SizeOfPredicates, 24 NumberOfNonLiveVariables, 549 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 148/160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 10:52:32,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE