./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 35987657 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-?-3598765 [2022-07-20 22:26:54,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:26:54,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:26:54,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:26:54,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:26:54,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:26:54,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:26:54,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:26:54,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:26:54,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:26:54,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:26:54,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:26:54,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:26:54,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:26:54,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:26:54,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:26:54,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:26:54,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:26:54,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:26:54,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:26:54,582 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:26:54,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:26:54,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:26:54,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:26:54,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:26:54,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:26:54,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:26:54,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:26:54,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:26:54,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:26:54,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:26:54,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:26:54,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:26:54,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:26:54,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:26:54,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:26:54,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:26:54,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:26:54,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:26:54,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:26:54,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:26:54,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:26:54,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:26:54,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:26:54,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:26:54,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:26:54,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:26:54,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:26:54,624 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:26:54,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:26:54,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:26:54,625 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:26:54,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:26:54,625 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:26:54,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:26:54,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:26:54,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:26:54,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:26:54,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:26:54,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:26:54,626 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:26:54,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:26:54,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:26:54,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:26:54,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:26:54,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:26:54,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:26:54,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:26:54,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:26:54,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:26:54,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:26:54,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:26:54,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:26:54,644 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:26:54,644 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:26:54,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:26:54,645 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-20 22:26:54,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:26:54,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:26:54,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:26:54,884 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:26:54,885 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:26:54,886 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-20 22:26:54,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2a66f84/b57cd2ed08194369a9ee0406d1df5dca/FLAGc93da9d9e [2022-07-20 22:26:55,320 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:26:55,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-20 22:26:55,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2a66f84/b57cd2ed08194369a9ee0406d1df5dca/FLAGc93da9d9e [2022-07-20 22:26:55,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2a66f84/b57cd2ed08194369a9ee0406d1df5dca [2022-07-20 22:26:55,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:26:55,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:26:55,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:26:55,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:26:55,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:26:55,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:26:55" (1/1) ... [2022-07-20 22:26:55,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7369a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:55, skipping insertion in model container [2022-07-20 22:26:55,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:26:55" (1/1) ... [2022-07-20 22:26:55,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:26:55,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:26:55,933 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-20 22:26:55,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:26:56,003 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:26:56,011 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-20 22:26:56,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:26:56,059 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:26:56,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:56 WrapperNode [2022-07-20 22:26:56,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:26:56,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:26:56,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:26:56,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:26:56,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:56" (1/1) ... [2022-07-20 22:26:56,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:56" (1/1) ... [2022-07-20 22:26:56,090 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-07-20 22:26:56,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:26:56,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:26:56,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:26:56,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:26:56,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:56" (1/1) ... [2022-07-20 22:26:56,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:56" (1/1) ... [2022-07-20 22:26:56,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:56" (1/1) ... [2022-07-20 22:26:56,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:56" (1/1) ... [2022-07-20 22:26:56,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:56" (1/1) ... [2022-07-20 22:26:56,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:56" (1/1) ... [2022-07-20 22:26:56,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:56" (1/1) ... [2022-07-20 22:26:56,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:26:56,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:26:56,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:26:56,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:26:56,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:56" (1/1) ... [2022-07-20 22:26:56,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:26:56,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:26:56,156 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-20 22:26:56,164 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-20 22:26:56,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:26:56,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:26:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-20 22:26:56,194 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-20 22:26:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:26:56,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:26:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-20 22:26:56,194 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-20 22:26:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-20 22:26:56,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-20 22:26:56,254 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:26:56,255 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:26:56,619 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:26:56,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:26:56,629 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 22:26:56,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:26:56 BoogieIcfgContainer [2022-07-20 22:26:56,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:26:56,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:26:56,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:26:56,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:26:56,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:26:55" (1/3) ... [2022-07-20 22:26:56,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6464262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:26:56, skipping insertion in model container [2022-07-20 22:26:56,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:26:56" (2/3) ... [2022-07-20 22:26:56,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6464262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:26:56, skipping insertion in model container [2022-07-20 22:26:56,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:26:56" (3/3) ... [2022-07-20 22:26:56,640 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-07-20 22:26:56,653 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:26:56,653 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:26:56,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:26:56,729 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@58123ede, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7243bc57 [2022-07-20 22:26:56,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:26:56,733 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-20 22:26:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 22:26:56,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:26:56,743 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-20 22:26:56,743 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:26:56,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:26:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash 176765495, now seen corresponding path program 1 times [2022-07-20 22:26:56,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:26:56,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985564808] [2022-07-20 22:26:56,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:26:56,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:26:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:26:56,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:26:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:26:56,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:26:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:26:56,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:26:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:26:57,006 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-20 22:26:57,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:26:57,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985564808] [2022-07-20 22:26:57,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985564808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:26:57,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:26:57,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:26:57,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910443372] [2022-07-20 22:26:57,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:26:57,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:26:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:26:57,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:26:57,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:26:57,054 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-20 22:26:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:26:57,174 INFO L93 Difference]: Finished difference Result 181 states and 305 transitions. [2022-07-20 22:26:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:26:57,177 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-20 22:26:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:26:57,186 INFO L225 Difference]: With dead ends: 181 [2022-07-20 22:26:57,187 INFO L226 Difference]: Without dead ends: 92 [2022-07-20 22:26:57,195 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-20 22:26:57,199 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-20 22:26:57,200 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-20 22:26:57,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-20 22:26:57,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2022-07-20 22:26:57,245 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-20 22:26:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2022-07-20 22:26:57,253 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 37 [2022-07-20 22:26:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:26:57,254 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2022-07-20 22:26:57,255 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-20 22:26:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2022-07-20 22:26:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 22:26:57,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:26:57,259 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-20 22:26:57,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:26:57,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:26:57,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:26:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1174822094, now seen corresponding path program 1 times [2022-07-20 22:26:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:26:57,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216495585] [2022-07-20 22:26:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:26:57,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:26:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:26:57,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:26:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:26:57,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:26:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:26:57,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:26:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:26:57,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 22:26:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:26:57,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 22:26:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:26:57,623 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-20 22:26:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:26:57,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216495585] [2022-07-20 22:26:57,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216495585] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:26:57,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836438161] [2022-07-20 22:26:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:26:57,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:26:57,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:26:57,635 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-20 22:26:57,665 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-20 22:26:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:26:57,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 22:26:57,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:26:57,956 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-20 22:26:57,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:26:58,171 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-20 22:26:58,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836438161] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:26:58,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:26:58,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 24 [2022-07-20 22:26:58,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581241275] [2022-07-20 22:26:58,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:26:58,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 22:26:58,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:26:58,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 22:26:58,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2022-07-20 22:26:58,176 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-20 22:27:01,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:01,008 INFO L93 Difference]: Finished difference Result 419 states and 669 transitions. [2022-07-20 22:27:01,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-20 22:27:01,010 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-20 22:27:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:01,014 INFO L225 Difference]: With dead ends: 419 [2022-07-20 22:27:01,015 INFO L226 Difference]: Without dead ends: 338 [2022-07-20 22:27:01,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=1562, Unknown=0, NotChecked=0, Total=1806 [2022-07-20 22:27:01,020 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 987 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 4133 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:01,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 553 Invalid, 4312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 4133 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 22:27:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-20 22:27:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 116. [2022-07-20 22:27:01,059 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-20 22:27:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2022-07-20 22:27:01,061 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 44 [2022-07-20 22:27:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:01,062 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2022-07-20 22:27:01,062 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-20 22:27:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2022-07-20 22:27:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 22:27:01,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:01,068 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-20 22:27:01,099 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-20 22:27:01,295 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-20 22:27:01,296 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1191712414, now seen corresponding path program 1 times [2022-07-20 22:27:01,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:01,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63678218] [2022-07-20 22:27:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:01,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:01,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:01,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:01,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:01,357 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-20 22:27:01,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:01,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63678218] [2022-07-20 22:27:01,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63678218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:01,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:01,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:27:01,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619156868] [2022-07-20 22:27:01,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:01,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:27:01,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:01,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:27:01,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:27:01,360 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-20 22:27:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:01,477 INFO L93 Difference]: Finished difference Result 212 states and 306 transitions. [2022-07-20 22:27:01,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:27:01,478 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-20 22:27:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:01,482 INFO L225 Difference]: With dead ends: 212 [2022-07-20 22:27:01,482 INFO L226 Difference]: Without dead ends: 132 [2022-07-20 22:27:01,483 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-20 22:27:01,484 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-20 22:27:01,484 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-20 22:27:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-20 22:27:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 117. [2022-07-20 22:27:01,500 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-20 22:27:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2022-07-20 22:27:01,501 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 43 [2022-07-20 22:27:01,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:01,502 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2022-07-20 22:27:01,502 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-20 22:27:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2022-07-20 22:27:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 22:27:01,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:01,504 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-20 22:27:01,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 22:27:01,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:01,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:01,505 INFO L85 PathProgramCache]: Analyzing trace with hash 186942930, now seen corresponding path program 1 times [2022-07-20 22:27:01,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:01,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043058453] [2022-07-20 22:27:01,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:01,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:01,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:01,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:01,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:01,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 22:27:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:01,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 22:27:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:01,774 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-20 22:27:01,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:01,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043058453] [2022-07-20 22:27:01,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043058453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:01,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:01,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-20 22:27:01,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709228135] [2022-07-20 22:27:01,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:01,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 22:27:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:01,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 22:27:01,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:27:01,777 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-20 22:27:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:03,341 INFO L93 Difference]: Finished difference Result 250 states and 362 transitions. [2022-07-20 22:27:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 22:27:03,341 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-20 22:27:03,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:03,343 INFO L225 Difference]: With dead ends: 250 [2022-07-20 22:27:03,343 INFO L226 Difference]: Without dead ends: 242 [2022-07-20 22:27:03,344 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-20 22:27:03,345 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 288 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:03,345 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.3s Time] [2022-07-20 22:27:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-20 22:27:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 122. [2022-07-20 22:27:03,361 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-20 22:27:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 173 transitions. [2022-07-20 22:27:03,362 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 173 transitions. Word has length 44 [2022-07-20 22:27:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:03,363 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 173 transitions. [2022-07-20 22:27:03,363 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-20 22:27:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 173 transitions. [2022-07-20 22:27:03,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 22:27:03,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:03,365 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-20 22:27:03,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 22:27:03,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:03,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:03,367 INFO L85 PathProgramCache]: Analyzing trace with hash -407484938, now seen corresponding path program 1 times [2022-07-20 22:27:03,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:03,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271362564] [2022-07-20 22:27:03,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:03,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:03,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:03,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:03,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 22:27:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:03,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 22:27:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:03,436 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-20 22:27:03,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:03,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271362564] [2022-07-20 22:27:03,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271362564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:03,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:03,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 22:27:03,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066996981] [2022-07-20 22:27:03,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:03,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 22:27:03,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:03,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 22:27:03,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 22:27:03,438 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-20 22:27:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:03,864 INFO L93 Difference]: Finished difference Result 179 states and 253 transitions. [2022-07-20 22:27:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 22:27:03,865 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-20 22:27:03,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:03,867 INFO L225 Difference]: With dead ends: 179 [2022-07-20 22:27:03,867 INFO L226 Difference]: Without dead ends: 168 [2022-07-20 22:27:03,868 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-20 22:27:03,869 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 201 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-20 22:27:03,869 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-20 22:27:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-20 22:27:03,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2022-07-20 22:27:03,880 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-20 22:27:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2022-07-20 22:27:03,881 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 46 [2022-07-20 22:27:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:03,882 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2022-07-20 22:27:03,882 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-20 22:27:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2022-07-20 22:27:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 22:27:03,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:03,884 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-20 22:27:03,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 22:27:03,884 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash -167909170, now seen corresponding path program 1 times [2022-07-20 22:27:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:03,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13978599] [2022-07-20 22:27:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:03,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:03,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:03,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:03,961 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-20 22:27:03,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:03,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13978599] [2022-07-20 22:27:03,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13978599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:03,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:03,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 22:27:03,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172606668] [2022-07-20 22:27:03,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:03,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 22:27:03,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:03,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 22:27:03,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 22:27:03,964 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-20 22:27:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:04,301 INFO L93 Difference]: Finished difference Result 222 states and 313 transitions. [2022-07-20 22:27:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 22:27:04,301 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-20 22:27:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:04,303 INFO L225 Difference]: With dead ends: 222 [2022-07-20 22:27:04,303 INFO L226 Difference]: Without dead ends: 166 [2022-07-20 22:27:04,303 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-20 22:27:04,304 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:04,304 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.3s Time] [2022-07-20 22:27:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-20 22:27:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2022-07-20 22:27:04,320 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-20 22:27:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2022-07-20 22:27:04,322 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 46 [2022-07-20 22:27:04,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:04,322 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2022-07-20 22:27:04,322 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-20 22:27:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2022-07-20 22:27:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 22:27:04,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:04,324 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-20 22:27:04,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 22:27:04,325 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:04,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1626225281, now seen corresponding path program 1 times [2022-07-20 22:27:04,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:04,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133597955] [2022-07-20 22:27:04,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:04,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:04,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:04,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:04,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:04,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 22:27:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:04,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 22:27:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:04,524 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-20 22:27:04,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:04,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133597955] [2022-07-20 22:27:04,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133597955] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:04,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881485349] [2022-07-20 22:27:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:04,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:04,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:04,526 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-20 22:27:04,528 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-20 22:27:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:04,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 22:27:04,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:04,835 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-20 22:27:04,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:05,270 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-20 22:27:05,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881485349] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:27:05,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:27:05,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 34 [2022-07-20 22:27:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199253869] [2022-07-20 22:27:05,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:27:05,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 22:27:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:05,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 22:27:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2022-07-20 22:27:05,273 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-20 22:27:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:11,182 INFO L93 Difference]: Finished difference Result 483 states and 769 transitions. [2022-07-20 22:27:11,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-20 22:27:11,182 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-20 22:27:11,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:11,186 INFO L225 Difference]: With dead ends: 483 [2022-07-20 22:27:11,186 INFO L226 Difference]: Without dead ends: 472 [2022-07-20 22:27:11,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=739, Invalid=6233, Unknown=0, NotChecked=0, Total=6972 [2022-07-20 22:27:11,190 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 797 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 8894 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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, 4.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:11,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 739 Invalid, 9161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 8894 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-20 22:27:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-20 22:27:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 164. [2022-07-20 22:27:11,211 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-20 22:27:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2022-07-20 22:27:11,214 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 48 [2022-07-20 22:27:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:11,214 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2022-07-20 22:27:11,214 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-20 22:27:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2022-07-20 22:27:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 22:27:11,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:11,216 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-20 22:27:11,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-20 22:27:11,431 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-20 22:27:11,432 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:11,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash 976965441, now seen corresponding path program 2 times [2022-07-20 22:27:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:11,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706988111] [2022-07-20 22:27:11,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:11,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:11,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:11,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:11,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 22:27:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:11,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 22:27:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:11,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 22:27:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:11,682 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-20 22:27:11,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:11,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706988111] [2022-07-20 22:27:11,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706988111] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:11,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535589680] [2022-07-20 22:27:11,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:27:11,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:11,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:11,687 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-20 22:27:11,689 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-20 22:27:11,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:27:11,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:27:11,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 22:27:11,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:11,896 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-20 22:27:11,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:12,192 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-20 22:27:12,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535589680] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:27:12,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:27:12,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-07-20 22:27:12,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000549470] [2022-07-20 22:27:12,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:27:12,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 22:27:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:12,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 22:27:12,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2022-07-20 22:27:12,194 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-20 22:27:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:15,318 INFO L93 Difference]: Finished difference Result 348 states and 670 transitions. [2022-07-20 22:27:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-20 22:27:15,319 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-20 22:27:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:15,322 INFO L225 Difference]: With dead ends: 348 [2022-07-20 22:27:15,322 INFO L226 Difference]: Without dead ends: 341 [2022-07-20 22:27:15,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=378, Invalid=3282, Unknown=0, NotChecked=0, Total=3660 [2022-07-20 22:27:15,324 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 809 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 4614 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:15,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 498 Invalid, 4828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 4614 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-20 22:27:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-20 22:27:15,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 172. [2022-07-20 22:27:15,365 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-20 22:27:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 272 transitions. [2022-07-20 22:27:15,368 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 272 transitions. Word has length 48 [2022-07-20 22:27:15,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:15,369 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 272 transitions. [2022-07-20 22:27:15,369 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-20 22:27:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 272 transitions. [2022-07-20 22:27:15,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 22:27:15,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:15,371 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-20 22:27:15,399 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-20 22:27:15,597 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-20 22:27:15,597 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1260029991, now seen corresponding path program 1 times [2022-07-20 22:27:15,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:15,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187440739] [2022-07-20 22:27:15,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:15,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:15,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:15,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:15,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:15,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 22:27:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:15,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 22:27:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:15,755 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-20 22:27:15,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:15,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187440739] [2022-07-20 22:27:15,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187440739] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:15,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272787108] [2022-07-20 22:27:15,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:15,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:15,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:15,760 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-20 22:27:15,761 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-20 22:27:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:15,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 22:27:15,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:15,906 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-20 22:27:15,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:16,141 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-20 22:27:16,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272787108] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:27:16,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:27:16,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 24 [2022-07-20 22:27:16,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572044564] [2022-07-20 22:27:16,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:27:16,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 22:27:16,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:16,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 22:27:16,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-20 22:27:16,142 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-20 22:27:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:17,989 INFO L93 Difference]: Finished difference Result 342 states and 591 transitions. [2022-07-20 22:27:17,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 22:27:17,989 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-20 22:27:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:17,992 INFO L225 Difference]: With dead ends: 342 [2022-07-20 22:27:17,992 INFO L226 Difference]: Without dead ends: 331 [2022-07-20 22:27:17,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2022-07-20 22:27:17,994 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 425 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 3749 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 3825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 3749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:17,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 463 Invalid, 3825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 3749 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-20 22:27:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-20 22:27:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 172. [2022-07-20 22:27:18,013 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-20 22:27:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 272 transitions. [2022-07-20 22:27:18,015 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 272 transitions. Word has length 50 [2022-07-20 22:27:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:18,015 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 272 transitions. [2022-07-20 22:27:18,015 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-20 22:27:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 272 transitions. [2022-07-20 22:27:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 22:27:18,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:18,017 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-20 22:27:18,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-20 22:27:18,231 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-20 22:27:18,231 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:18,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:18,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1462321561, now seen corresponding path program 1 times [2022-07-20 22:27:18,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:18,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917232277] [2022-07-20 22:27:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:18,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:18,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:18,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:18,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 22:27:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:18,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 22:27:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:18,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 22:27:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:18,435 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-20 22:27:18,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:18,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917232277] [2022-07-20 22:27:18,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917232277] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:18,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658368054] [2022-07-20 22:27:18,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:18,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:18,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:18,438 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-20 22:27:18,438 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-20 22:27:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:18,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 22:27:18,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:18,616 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-20 22:27:18,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:18,903 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-20 22:27:18,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658368054] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:27:18,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:27:18,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 31 [2022-07-20 22:27:18,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227832783] [2022-07-20 22:27:18,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:27:18,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 22:27:18,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:18,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 22:27:18,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=861, Unknown=0, NotChecked=0, Total=930 [2022-07-20 22:27:18,905 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-20 22:27:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:21,834 INFO L93 Difference]: Finished difference Result 343 states and 636 transitions. [2022-07-20 22:27:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-20 22:27:21,834 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-20 22:27:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:21,837 INFO L225 Difference]: With dead ends: 343 [2022-07-20 22:27:21,837 INFO L226 Difference]: Without dead ends: 320 [2022-07-20 22:27:21,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=449, Invalid=4107, Unknown=0, NotChecked=0, Total=4556 [2022-07-20 22:27:21,840 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 792 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 4569 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:21,840 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.9s Time] [2022-07-20 22:27:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-20 22:27:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 180. [2022-07-20 22:27:21,860 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-20 22:27:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 289 transitions. [2022-07-20 22:27:21,862 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 289 transitions. Word has length 50 [2022-07-20 22:27:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:21,863 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 289 transitions. [2022-07-20 22:27:21,863 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-20 22:27:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 289 transitions. [2022-07-20 22:27:21,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 22:27:21,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:21,865 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-20 22:27:21,891 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-20 22:27:22,088 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-20 22:27:22,088 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1556864061, now seen corresponding path program 1 times [2022-07-20 22:27:22,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:22,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176460046] [2022-07-20 22:27:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:22,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,144 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-20 22:27:22,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:22,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176460046] [2022-07-20 22:27:22,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176460046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:22,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:22,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:27:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769569260] [2022-07-20 22:27:22,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:22,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:27:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:22,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:27:22,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:27:22,149 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-20 22:27:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:22,230 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2022-07-20 22:27:22,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:27:22,231 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-20 22:27:22,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:22,232 INFO L225 Difference]: With dead ends: 304 [2022-07-20 22:27:22,232 INFO L226 Difference]: Without dead ends: 188 [2022-07-20 22:27:22,234 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-20 22:27:22,235 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:22,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 191 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:27:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-20 22:27:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2022-07-20 22:27:22,250 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-20 22:27:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 288 transitions. [2022-07-20 22:27:22,252 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 288 transitions. Word has length 50 [2022-07-20 22:27:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:22,252 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 288 transitions. [2022-07-20 22:27:22,252 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-20 22:27:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 288 transitions. [2022-07-20 22:27:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 22:27:22,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:22,254 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-20 22:27:22,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 22:27:22,254 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:22,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1943903020, now seen corresponding path program 1 times [2022-07-20 22:27:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:22,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294196296] [2022-07-20 22:27:22,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 22:27:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-20 22:27:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,310 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-20 22:27:22,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:22,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294196296] [2022-07-20 22:27:22,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294196296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:22,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:22,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:27:22,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845046023] [2022-07-20 22:27:22,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:22,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:27:22,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:22,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:27:22,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:27:22,314 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-20 22:27:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:22,625 INFO L93 Difference]: Finished difference Result 426 states and 705 transitions. [2022-07-20 22:27:22,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 22:27:22,625 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-20 22:27:22,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:22,628 INFO L225 Difference]: With dead ends: 426 [2022-07-20 22:27:22,628 INFO L226 Difference]: Without dead ends: 263 [2022-07-20 22:27:22,630 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-20 22:27:22,630 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 223 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:22,631 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.3s Time] [2022-07-20 22:27:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-20 22:27:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 181. [2022-07-20 22:27:22,649 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-20 22:27:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 289 transitions. [2022-07-20 22:27:22,651 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 289 transitions. Word has length 52 [2022-07-20 22:27:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:22,651 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 289 transitions. [2022-07-20 22:27:22,651 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-20 22:27:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2022-07-20 22:27:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 22:27:22,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:22,653 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-20 22:27:22,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 22:27:22,653 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:22,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:22,654 INFO L85 PathProgramCache]: Analyzing trace with hash 380344415, now seen corresponding path program 1 times [2022-07-20 22:27:22,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:22,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987789180] [2022-07-20 22:27:22,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:22,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 22:27:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 22:27:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,807 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-20 22:27:22,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:22,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987789180] [2022-07-20 22:27:22,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987789180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:22,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61053158] [2022-07-20 22:27:22,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:22,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:22,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:22,810 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-20 22:27:22,810 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-20 22:27:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:22,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 22:27:22,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:23,022 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-20 22:27:23,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:23,344 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-20 22:27:23,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61053158] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:27:23,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:27:23,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2022-07-20 22:27:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328942972] [2022-07-20 22:27:23,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:27:23,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-20 22:27:23,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:23,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-20 22:27:23,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2022-07-20 22:27:23,346 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-20 22:27:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:29,494 INFO L93 Difference]: Finished difference Result 673 states and 1221 transitions. [2022-07-20 22:27:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-20 22:27:29,494 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-20 22:27:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:29,498 INFO L225 Difference]: With dead ends: 673 [2022-07-20 22:27:29,499 INFO L226 Difference]: Without dead ends: 553 [2022-07-20 22:27:29,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=836, Invalid=8284, Unknown=0, NotChecked=0, Total=9120 [2022-07-20 22:27:29,503 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 1059 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 10055 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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, 4.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:29,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 812 Invalid, 10356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 10055 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-20 22:27:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-07-20 22:27:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 226. [2022-07-20 22:27:29,557 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-20 22:27:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 409 transitions. [2022-07-20 22:27:29,563 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 409 transitions. Word has length 53 [2022-07-20 22:27:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:29,563 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 409 transitions. [2022-07-20 22:27:29,563 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-20 22:27:29,564 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 409 transitions. [2022-07-20 22:27:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 22:27:29,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:29,565 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-20 22:27:29,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-20 22:27:29,786 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-20 22:27:29,786 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:29,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:29,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2040511084, now seen corresponding path program 1 times [2022-07-20 22:27:29,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:29,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705973387] [2022-07-20 22:27:29,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:29,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:29,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:29,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:29,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 22:27:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:29,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 22:27:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:29,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 22:27:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:29,872 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-20 22:27:29,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:29,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705973387] [2022-07-20 22:27:29,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705973387] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:29,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253598067] [2022-07-20 22:27:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:29,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:29,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:29,874 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-20 22:27:29,879 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-20 22:27:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:29,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 22:27:29,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:30,005 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-20 22:27:30,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:30,165 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-20 22:27:30,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253598067] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:27:30,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:27:30,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 20 [2022-07-20 22:27:30,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532858938] [2022-07-20 22:27:30,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:27:30,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 22:27:30,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:30,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 22:27:30,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-20 22:27:30,167 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-20 22:27:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:32,249 INFO L93 Difference]: Finished difference Result 607 states and 1268 transitions. [2022-07-20 22:27:32,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 22:27:32,249 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-20 22:27:32,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:32,253 INFO L225 Difference]: With dead ends: 607 [2022-07-20 22:27:32,253 INFO L226 Difference]: Without dead ends: 396 [2022-07-20 22:27:32,258 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-20 22:27:32,259 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 421 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 3835 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:32,259 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.6s Time] [2022-07-20 22:27:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-20 22:27:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 257. [2022-07-20 22:27:32,293 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-20 22:27:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 495 transitions. [2022-07-20 22:27:32,296 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 495 transitions. Word has length 53 [2022-07-20 22:27:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:32,296 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 495 transitions. [2022-07-20 22:27:32,296 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-20 22:27:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 495 transitions. [2022-07-20 22:27:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 22:27:32,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:32,299 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-20 22:27:32,327 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-20 22:27:32,511 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-20 22:27:32,511 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:32,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1827539848, now seen corresponding path program 1 times [2022-07-20 22:27:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:32,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414591178] [2022-07-20 22:27:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:32,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:32,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:32,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:32,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:32,592 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-20 22:27:32,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:32,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414591178] [2022-07-20 22:27:32,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414591178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:32,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151209767] [2022-07-20 22:27:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:32,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:32,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:32,595 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-20 22:27:32,596 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-20 22:27:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:32,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:27:32,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:32,762 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-20 22:27:32,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:32,827 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-20 22:27:32,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151209767] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:27:32,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:27:32,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-07-20 22:27:32,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471685184] [2022-07-20 22:27:32,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:27:32,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 22:27:32,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:32,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 22:27:32,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-20 22:27:32,829 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-20 22:27:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:33,784 INFO L93 Difference]: Finished difference Result 612 states and 1350 transitions. [2022-07-20 22:27:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 22:27:33,785 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-20 22:27:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:33,792 INFO L225 Difference]: With dead ends: 612 [2022-07-20 22:27:33,792 INFO L226 Difference]: Without dead ends: 495 [2022-07-20 22:27:33,795 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-20 22:27:33,796 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 225 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:33,797 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.8s Time] [2022-07-20 22:27:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-07-20 22:27:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 269. [2022-07-20 22:27:33,852 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-20 22:27:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 495 transitions. [2022-07-20 22:27:33,856 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 495 transitions. Word has length 53 [2022-07-20 22:27:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:33,856 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 495 transitions. [2022-07-20 22:27:33,856 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-20 22:27:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 495 transitions. [2022-07-20 22:27:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 22:27:33,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:33,860 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-20 22:27:33,889 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-20 22:27:34,084 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-20 22:27:34,085 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:34,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:34,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2006096899, now seen corresponding path program 1 times [2022-07-20 22:27:34,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:34,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404511245] [2022-07-20 22:27:34,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:34,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 22:27:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 22:27:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 22:27:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,148 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-20 22:27:34,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:34,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404511245] [2022-07-20 22:27:34,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404511245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:34,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042661942] [2022-07-20 22:27:34,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:34,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:34,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:34,151 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-20 22:27:34,160 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-20 22:27:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 22:27:34,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:34,234 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-20 22:27:34,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:27:34,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042661942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:34,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 22:27:34,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-20 22:27:34,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173250842] [2022-07-20 22:27:34,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:34,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:27:34,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:34,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:27:34,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:27:34,236 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-20 22:27:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:34,297 INFO L93 Difference]: Finished difference Result 496 states and 887 transitions. [2022-07-20 22:27:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 22:27:34,297 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-20 22:27:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:34,300 INFO L225 Difference]: With dead ends: 496 [2022-07-20 22:27:34,300 INFO L226 Difference]: Without dead ends: 276 [2022-07-20 22:27:34,302 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-20 22:27:34,303 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-20 22:27:34,303 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-20 22:27:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-20 22:27:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2022-07-20 22:27:34,334 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-20 22:27:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 497 transitions. [2022-07-20 22:27:34,338 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 497 transitions. Word has length 54 [2022-07-20 22:27:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:34,338 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 497 transitions. [2022-07-20 22:27:34,338 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-20 22:27:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 497 transitions. [2022-07-20 22:27:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 22:27:34,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:34,341 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-20 22:27:34,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 22:27:34,563 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-20 22:27:34,564 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:34,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1697379934, now seen corresponding path program 1 times [2022-07-20 22:27:34,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:34,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728633816] [2022-07-20 22:27:34,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:34,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 22:27:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 22:27:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-20 22:27:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:34,861 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-20 22:27:34,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:34,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728633816] [2022-07-20 22:27:34,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728633816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:34,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:34,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-20 22:27:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886100163] [2022-07-20 22:27:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:34,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 22:27:34,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 22:27:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-20 22:27:34,863 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-20 22:27:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:36,469 INFO L93 Difference]: Finished difference Result 399 states and 828 transitions. [2022-07-20 22:27:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 22:27:36,469 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-20 22:27:36,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:36,473 INFO L225 Difference]: With dead ends: 399 [2022-07-20 22:27:36,473 INFO L226 Difference]: Without dead ends: 388 [2022-07-20 22:27:36,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2022-07-20 22:27:36,474 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 370 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2761 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:36,475 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.3s Time] [2022-07-20 22:27:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-07-20 22:27:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 268. [2022-07-20 22:27:36,512 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-20 22:27:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 494 transitions. [2022-07-20 22:27:36,520 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 494 transitions. Word has length 55 [2022-07-20 22:27:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:36,521 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 494 transitions. [2022-07-20 22:27:36,521 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-20 22:27:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 494 transitions. [2022-07-20 22:27:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 22:27:36,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:36,523 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-20 22:27:36,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 22:27:36,524 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:36,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:36,524 INFO L85 PathProgramCache]: Analyzing trace with hash -954910152, now seen corresponding path program 1 times [2022-07-20 22:27:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:36,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727559438] [2022-07-20 22:27:36,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:36,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:36,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:36,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:36,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 22:27:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:36,623 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-20 22:27:36,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:36,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727559438] [2022-07-20 22:27:36,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727559438] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:36,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522103134] [2022-07-20 22:27:36,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:36,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:36,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:36,628 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-20 22:27:36,639 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-20 22:27:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:36,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:27:36,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:36,794 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-20 22:27:36,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:27:36,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522103134] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:36,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 22:27:36,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-07-20 22:27:36,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050255185] [2022-07-20 22:27:36,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:36,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 22:27:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:36,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 22:27:36,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-07-20 22:27:36,795 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-20 22:27:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:37,008 INFO L93 Difference]: Finished difference Result 713 states and 1469 transitions. [2022-07-20 22:27:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 22:27:37,009 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-20 22:27:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:37,014 INFO L225 Difference]: With dead ends: 713 [2022-07-20 22:27:37,024 INFO L226 Difference]: Without dead ends: 656 [2022-07-20 22:27:37,025 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-20 22:27:37,026 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-20 22:27:37,026 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-20 22:27:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-07-20 22:27:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 367. [2022-07-20 22:27:37,083 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-20 22:27:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 626 transitions. [2022-07-20 22:27:37,086 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 626 transitions. Word has length 57 [2022-07-20 22:27:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:37,086 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 626 transitions. [2022-07-20 22:27:37,086 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-20 22:27:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 626 transitions. [2022-07-20 22:27:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 22:27:37,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:37,089 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-20 22:27:37,112 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-20 22:27:37,302 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-20 22:27:37,302 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:37,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:37,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1347937162, now seen corresponding path program 1 times [2022-07-20 22:27:37,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:37,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236736830] [2022-07-20 22:27:37,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:37,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:37,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:37,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:37,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:37,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 22:27:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:37,410 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-20 22:27:37,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:37,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236736830] [2022-07-20 22:27:37,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236736830] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:37,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093883148] [2022-07-20 22:27:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:37,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:37,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:37,416 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-20 22:27:37,438 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-20 22:27:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:37,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 22:27:37,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:37,569 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-20 22:27:37,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:27:37,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093883148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:37,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 22:27:37,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-20 22:27:37,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656134561] [2022-07-20 22:27:37,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:37,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 22:27:37,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:37,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 22:27:37,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-20 22:27:37,572 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-20 22:27:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:37,797 INFO L93 Difference]: Finished difference Result 940 states and 1818 transitions. [2022-07-20 22:27:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 22:27:37,798 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-20 22:27:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:37,803 INFO L225 Difference]: With dead ends: 940 [2022-07-20 22:27:37,803 INFO L226 Difference]: Without dead ends: 759 [2022-07-20 22:27:37,806 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-20 22:27:37,806 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-20 22:27:37,806 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-20 22:27:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-07-20 22:27:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 429. [2022-07-20 22:27:37,874 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-20 22:27:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 714 transitions. [2022-07-20 22:27:37,876 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 714 transitions. Word has length 57 [2022-07-20 22:27:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:37,877 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 714 transitions. [2022-07-20 22:27:37,877 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-20 22:27:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 714 transitions. [2022-07-20 22:27:37,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 22:27:37,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:37,879 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-20 22:27:37,902 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-20 22:27:38,095 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-20 22:27:38,095 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:38,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:38,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1088923658, now seen corresponding path program 1 times [2022-07-20 22:27:38,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:38,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360466665] [2022-07-20 22:27:38,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:38,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:38,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:38,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:38,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:38,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 22:27:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:38,192 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-20 22:27:38,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:38,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360466665] [2022-07-20 22:27:38,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360466665] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:38,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537701282] [2022-07-20 22:27:38,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:38,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:38,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:38,196 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-20 22:27:38,216 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-20 22:27:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:38,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 22:27:38,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:38,341 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-20 22:27:38,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:27:38,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537701282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:38,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 22:27:38,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-07-20 22:27:38,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657912402] [2022-07-20 22:27:38,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:38,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 22:27:38,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:38,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 22:27:38,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:27:38,342 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-20 22:27:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:38,464 INFO L93 Difference]: Finished difference Result 567 states and 1019 transitions. [2022-07-20 22:27:38,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 22:27:38,465 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-20 22:27:38,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:38,468 INFO L225 Difference]: With dead ends: 567 [2022-07-20 22:27:38,468 INFO L226 Difference]: Without dead ends: 476 [2022-07-20 22:27:38,469 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-20 22:27:38,470 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-20 22:27:38,470 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-20 22:27:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-07-20 22:27:38,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 353. [2022-07-20 22:27:38,521 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-20 22:27:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 609 transitions. [2022-07-20 22:27:38,524 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 609 transitions. Word has length 57 [2022-07-20 22:27:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:38,529 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 609 transitions. [2022-07-20 22:27:38,529 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-20 22:27:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 609 transitions. [2022-07-20 22:27:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 22:27:38,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:38,531 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-20 22:27:38,562 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-20 22:27:38,756 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-20 22:27:38,756 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:38,756 INFO L85 PathProgramCache]: Analyzing trace with hash 998579127, now seen corresponding path program 2 times [2022-07-20 22:27:38,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:38,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490200912] [2022-07-20 22:27:38,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:38,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:38,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:38,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:38,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 22:27:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:38,836 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-20 22:27:38,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:38,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490200912] [2022-07-20 22:27:38,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490200912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:38,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:38,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 22:27:38,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288070276] [2022-07-20 22:27:38,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:38,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:27:38,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:38,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:27:38,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:27:38,838 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-20 22:27:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:39,339 INFO L93 Difference]: Finished difference Result 797 states and 1470 transitions. [2022-07-20 22:27:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 22:27:39,339 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-20 22:27:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:39,342 INFO L225 Difference]: With dead ends: 797 [2022-07-20 22:27:39,342 INFO L226 Difference]: Without dead ends: 548 [2022-07-20 22:27:39,346 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-20 22:27:39,347 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-20 22:27:39,347 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-20 22:27:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-20 22:27:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 454. [2022-07-20 22:27:39,408 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-20 22:27:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 714 transitions. [2022-07-20 22:27:39,410 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 714 transitions. Word has length 57 [2022-07-20 22:27:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:39,410 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 714 transitions. [2022-07-20 22:27:39,411 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-20 22:27:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 714 transitions. [2022-07-20 22:27:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 22:27:39,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:39,413 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-20 22:27:39,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 22:27:39,413 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:39,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash -12538123, now seen corresponding path program 1 times [2022-07-20 22:27:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:39,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34639265] [2022-07-20 22:27:39,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:39,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:39,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:39,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 22:27:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:39,483 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-20 22:27:39,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:39,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34639265] [2022-07-20 22:27:39,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34639265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:39,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760910110] [2022-07-20 22:27:39,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:39,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:39,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:39,488 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-20 22:27:39,512 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-20 22:27:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:39,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 22:27:39,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:39,589 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-20 22:27:39,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:39,638 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-20 22:27:39,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760910110] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:39,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:27:39,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11, 10] total 12 [2022-07-20 22:27:39,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454010947] [2022-07-20 22:27:39,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:39,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:27:39,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:39,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:27:39,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-20 22:27:39,640 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-20 22:27:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:39,707 INFO L93 Difference]: Finished difference Result 773 states and 1335 transitions. [2022-07-20 22:27:39,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:27:39,708 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-20 22:27:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:39,711 INFO L225 Difference]: With dead ends: 773 [2022-07-20 22:27:39,711 INFO L226 Difference]: Without dead ends: 474 [2022-07-20 22:27:39,715 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-20 22:27:39,716 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-20 22:27:39,716 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-20 22:27:39,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-20 22:27:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-07-20 22:27:39,769 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-20 22:27:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 732 transitions. [2022-07-20 22:27:39,773 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 732 transitions. Word has length 57 [2022-07-20 22:27:39,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:39,773 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 732 transitions. [2022-07-20 22:27:39,773 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-20 22:27:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 732 transitions. [2022-07-20 22:27:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 22:27:39,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:39,776 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-20 22:27:39,800 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-20 22:27:39,991 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-20 22:27:39,992 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:39,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash -10691081, now seen corresponding path program 1 times [2022-07-20 22:27:39,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:39,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765606686] [2022-07-20 22:27:39,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:40,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 22:27:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:40,239 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-20 22:27:40,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:40,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765606686] [2022-07-20 22:27:40,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765606686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:40,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:40,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-20 22:27:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572357660] [2022-07-20 22:27:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:40,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 22:27:40,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:40,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 22:27:40,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-20 22:27:40,241 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-20 22:27:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:40,913 INFO L93 Difference]: Finished difference Result 801 states and 1155 transitions. [2022-07-20 22:27:40,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 22:27:40,914 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-20 22:27:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:40,918 INFO L225 Difference]: With dead ends: 801 [2022-07-20 22:27:40,918 INFO L226 Difference]: Without dead ends: 608 [2022-07-20 22:27:40,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2022-07-20 22:27:40,920 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 276 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-20 22:27:40,921 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-20 22:27:40,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-20 22:27:41,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 568. [2022-07-20 22:27:41,005 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-20 22:27:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 834 transitions. [2022-07-20 22:27:41,008 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 834 transitions. Word has length 57 [2022-07-20 22:27:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:41,009 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 834 transitions. [2022-07-20 22:27:41,009 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-20 22:27:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 834 transitions. [2022-07-20 22:27:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 22:27:41,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:41,011 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-20 22:27:41,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 22:27:41,012 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:41,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:41,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1534810419, now seen corresponding path program 1 times [2022-07-20 22:27:41,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:41,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124510115] [2022-07-20 22:27:41,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:41,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:41,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:41,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:41,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 22:27:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:41,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 22:27:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:41,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 22:27:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:41,123 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-20 22:27:41,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:41,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124510115] [2022-07-20 22:27:41,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124510115] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:41,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44900241] [2022-07-20 22:27:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:41,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:41,125 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-20 22:27:41,147 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-20 22:27:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:41,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 22:27:41,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:41,298 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-20 22:27:41,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:41,502 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-20 22:27:41,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44900241] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:27:41,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:27:41,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-07-20 22:27:41,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652548402] [2022-07-20 22:27:41,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:27:41,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 22:27:41,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:41,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 22:27:41,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2022-07-20 22:27:41,504 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-20 22:27:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:44,320 INFO L93 Difference]: Finished difference Result 924 states and 1487 transitions. [2022-07-20 22:27:44,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-20 22:27:44,321 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-20 22:27:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:44,325 INFO L225 Difference]: With dead ends: 924 [2022-07-20 22:27:44,325 INFO L226 Difference]: Without dead ends: 791 [2022-07-20 22:27:44,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=484, Invalid=2596, Unknown=0, NotChecked=0, Total=3080 [2022-07-20 22:27:44,328 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 557 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 4812 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:44,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 581 Invalid, 4958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 4812 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-20 22:27:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-07-20 22:27:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 564. [2022-07-20 22:27:44,413 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-20 22:27:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 818 transitions. [2022-07-20 22:27:44,416 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 818 transitions. Word has length 59 [2022-07-20 22:27:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:44,416 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 818 transitions. [2022-07-20 22:27:44,417 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-20 22:27:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 818 transitions. [2022-07-20 22:27:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 22:27:44,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:44,419 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-20 22:27:44,445 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-20 22:27:44,643 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-20 22:27:44,643 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:44,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:44,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1198827729, now seen corresponding path program 1 times [2022-07-20 22:27:44,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:44,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941855571] [2022-07-20 22:27:44,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:44,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:44,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:44,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 22:27:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:44,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 22:27:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:44,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 22:27:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:44,756 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-20 22:27:44,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:44,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941855571] [2022-07-20 22:27:44,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941855571] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:44,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653047491] [2022-07-20 22:27:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:44,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:44,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:44,759 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-20 22:27:44,787 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-20 22:27:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:44,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 22:27:44,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:44,909 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-20 22:27:44,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:45,040 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-20 22:27:45,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653047491] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:27:45,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:27:45,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-07-20 22:27:45,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934962754] [2022-07-20 22:27:45,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:27:45,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 22:27:45,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:45,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 22:27:45,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-20 22:27:45,042 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-20 22:27:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:46,854 INFO L93 Difference]: Finished difference Result 1164 states and 1757 transitions. [2022-07-20 22:27:46,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 22:27:46,854 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-20 22:27:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:46,857 INFO L225 Difference]: With dead ends: 1164 [2022-07-20 22:27:46,858 INFO L226 Difference]: Without dead ends: 869 [2022-07-20 22:27:46,859 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-20 22:27:46,860 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 949 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 3054 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 3054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:46,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 538 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 3054 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-20 22:27:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-07-20 22:27:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 644. [2022-07-20 22:27:46,960 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-20 22:27:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 872 transitions. [2022-07-20 22:27:46,963 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 872 transitions. Word has length 60 [2022-07-20 22:27:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:46,963 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 872 transitions. [2022-07-20 22:27:46,964 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-20 22:27:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 872 transitions. [2022-07-20 22:27:46,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-20 22:27:46,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:46,967 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-20 22:27:46,991 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-20 22:27:47,183 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-20 22:27:47,183 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:47,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1214292501, now seen corresponding path program 1 times [2022-07-20 22:27:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:47,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100651175] [2022-07-20 22:27:47,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:47,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:47,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:47,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 22:27:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:47,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-20 22:27:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:47,260 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-20 22:27:47,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:47,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100651175] [2022-07-20 22:27:47,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100651175] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:47,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775762999] [2022-07-20 22:27:47,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:47,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:47,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:47,264 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-20 22:27:47,291 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-20 22:27:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:47,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 22:27:47,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:47,433 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-20 22:27:47,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:47,485 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-20 22:27:47,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775762999] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:27:47,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:27:47,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-07-20 22:27:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637871098] [2022-07-20 22:27:47,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:27:47,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 22:27:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:47,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 22:27:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-20 22:27:47,487 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-20 22:27:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:48,662 INFO L93 Difference]: Finished difference Result 1351 states and 1983 transitions. [2022-07-20 22:27:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 22:27:48,663 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-20 22:27:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:48,667 INFO L225 Difference]: With dead ends: 1351 [2022-07-20 22:27:48,667 INFO L226 Difference]: Without dead ends: 1128 [2022-07-20 22:27:48,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2022-07-20 22:27:48,669 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.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:48,669 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.9s Time] [2022-07-20 22:27:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2022-07-20 22:27:48,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 617. [2022-07-20 22:27:48,743 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-20 22:27:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 837 transitions. [2022-07-20 22:27:48,745 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 837 transitions. Word has length 61 [2022-07-20 22:27:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:48,746 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 837 transitions. [2022-07-20 22:27:48,746 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-20 22:27:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 837 transitions. [2022-07-20 22:27:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 22:27:48,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:48,748 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-20 22:27:48,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 22:27:48,963 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-20 22:27:48,963 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:48,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1453926245, now seen corresponding path program 1 times [2022-07-20 22:27:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:48,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097284796] [2022-07-20 22:27:48,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:48,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:49,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:49,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:49,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 22:27:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:49,039 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-20 22:27:49,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:49,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097284796] [2022-07-20 22:27:49,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097284796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:49,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831817712] [2022-07-20 22:27:49,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:49,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:49,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:49,041 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-20 22:27:49,043 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-20 22:27:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:49,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:27:49,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:49,141 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-20 22:27:49,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:49,198 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-20 22:27:49,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831817712] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:27:49,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:27:49,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-07-20 22:27:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909203440] [2022-07-20 22:27:49,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:27:49,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:27:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:49,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:27:49,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:27:49,201 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-20 22:27:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:49,758 INFO L93 Difference]: Finished difference Result 1077 states and 1470 transitions. [2022-07-20 22:27:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 22:27:49,758 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-20 22:27:49,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:49,761 INFO L225 Difference]: With dead ends: 1077 [2022-07-20 22:27:49,761 INFO L226 Difference]: Without dead ends: 779 [2022-07-20 22:27:49,762 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-20 22:27:49,763 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-20 22:27:49,763 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-20 22:27:49,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-07-20 22:27:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 610. [2022-07-20 22:27:49,839 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-20 22:27:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 826 transitions. [2022-07-20 22:27:49,841 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 826 transitions. Word has length 60 [2022-07-20 22:27:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:49,842 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 826 transitions. [2022-07-20 22:27:49,842 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-20 22:27:49,842 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 826 transitions. [2022-07-20 22:27:49,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 22:27:49,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:49,843 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-20 22:27:49,867 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-20 22:27:50,064 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-20 22:27:50,064 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:50,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2131752737, now seen corresponding path program 1 times [2022-07-20 22:27:50,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:50,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130085245] [2022-07-20 22:27:50,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:50,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:50,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:50,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:50,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 22:27:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:50,131 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-20 22:27:50,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:50,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130085245] [2022-07-20 22:27:50,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130085245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:27:50,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801806966] [2022-07-20 22:27:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:50,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:27:50,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:50,133 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-20 22:27:50,134 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-20 22:27:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:50,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 22:27:50,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:50,287 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-20 22:27:50,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:27:50,428 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-20 22:27:50,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801806966] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:27:50,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:27:50,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-07-20 22:27:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367674505] [2022-07-20 22:27:50,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:27:50,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 22:27:50,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:50,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 22:27:50,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-20 22:27:50,429 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-20 22:27:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:51,585 INFO L93 Difference]: Finished difference Result 1342 states and 1932 transitions. [2022-07-20 22:27:51,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 22:27:51,586 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-20 22:27:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:51,590 INFO L225 Difference]: With dead ends: 1342 [2022-07-20 22:27:51,590 INFO L226 Difference]: Without dead ends: 968 [2022-07-20 22:27:51,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1302, Unknown=0, NotChecked=0, Total=1560 [2022-07-20 22:27:51,593 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 449 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-20 22:27:51,593 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-20 22:27:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-07-20 22:27:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 698. [2022-07-20 22:27:51,702 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-20 22:27:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 928 transitions. [2022-07-20 22:27:51,704 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 928 transitions. Word has length 60 [2022-07-20 22:27:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:51,705 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 928 transitions. [2022-07-20 22:27:51,705 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-20 22:27:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 928 transitions. [2022-07-20 22:27:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 22:27:51,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:51,707 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-20 22:27:51,729 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-20 22:27:51,927 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-20 22:27:51,927 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:51,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1940152897, now seen corresponding path program 1 times [2022-07-20 22:27:51,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:51,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857815124] [2022-07-20 22:27:51,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:51,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:51,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:51,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 22:27:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:52,011 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-20 22:27:52,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:52,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857815124] [2022-07-20 22:27:52,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857815124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:52,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:52,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 22:27:52,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422812228] [2022-07-20 22:27:52,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:52,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 22:27:52,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:52,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 22:27:52,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-20 22:27:52,014 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-20 22:27:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:53,079 INFO L93 Difference]: Finished difference Result 1624 states and 2442 transitions. [2022-07-20 22:27:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 22:27:53,079 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-20 22:27:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:53,084 INFO L225 Difference]: With dead ends: 1624 [2022-07-20 22:27:53,084 INFO L226 Difference]: Without dead ends: 1444 [2022-07-20 22:27:53,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2022-07-20 22:27:53,086 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:53,086 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.8s Time] [2022-07-20 22:27:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-07-20 22:27:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 889. [2022-07-20 22:27:53,230 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-20 22:27:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1174 transitions. [2022-07-20 22:27:53,233 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1174 transitions. Word has length 60 [2022-07-20 22:27:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:53,233 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1174 transitions. [2022-07-20 22:27:53,234 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-20 22:27:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1174 transitions. [2022-07-20 22:27:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 22:27:53,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:53,236 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-20 22:27:53,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-20 22:27:53,236 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1676987907, now seen corresponding path program 1 times [2022-07-20 22:27:53,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:53,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411976407] [2022-07-20 22:27:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:53,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:53,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:53,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:53,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 22:27:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:53,299 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-20 22:27:53,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:53,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411976407] [2022-07-20 22:27:53,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411976407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:53,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:53,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 22:27:53,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773803266] [2022-07-20 22:27:53,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:53,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:27:53,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:53,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:27:53,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:27:53,301 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-20 22:27:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:54,187 INFO L93 Difference]: Finished difference Result 1900 states and 2818 transitions. [2022-07-20 22:27:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 22:27:54,188 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-20 22:27:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:54,192 INFO L225 Difference]: With dead ends: 1900 [2022-07-20 22:27:54,192 INFO L226 Difference]: Without dead ends: 1583 [2022-07-20 22:27:54,194 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-20 22:27:54,194 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 577 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:54,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 569 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 22:27:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-07-20 22:27:54,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 996. [2022-07-20 22:27:54,341 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-20 22:27:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1311 transitions. [2022-07-20 22:27:54,344 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1311 transitions. Word has length 60 [2022-07-20 22:27:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:54,345 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1311 transitions. [2022-07-20 22:27:54,345 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-20 22:27:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1311 transitions. [2022-07-20 22:27:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 22:27:54,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:54,347 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-20 22:27:54,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-20 22:27:54,347 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:54,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2074166403, now seen corresponding path program 2 times [2022-07-20 22:27:54,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:54,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727219496] [2022-07-20 22:27:54,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:54,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 22:27:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:54,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 22:27:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 22:27:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:54,412 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-20 22:27:54,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:27:54,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727219496] [2022-07-20 22:27:54,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727219496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:54,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:54,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 22:27:54,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704581515] [2022-07-20 22:27:54,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:54,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:27:54,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:27:54,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:27:54,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:27:54,414 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-20 22:27:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:54,999 INFO L93 Difference]: Finished difference Result 1368 states and 1904 transitions. [2022-07-20 22:27:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 22:27:55,000 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-20 22:27:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:55,004 INFO L225 Difference]: With dead ends: 1368 [2022-07-20 22:27:55,004 INFO L226 Difference]: Without dead ends: 1143 [2022-07-20 22:27:55,006 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-20 22:27:55,006 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:27:55,007 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.4s Time] [2022-07-20 22:27:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-07-20 22:27:55,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 905. [2022-07-20 22:27:55,138 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-20 22:27:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1188 transitions. [2022-07-20 22:27:55,141 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1188 transitions. Word has length 60 [2022-07-20 22:27:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:55,141 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1188 transitions. [2022-07-20 22:27:55,141 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-20 22:27:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1188 transitions. [2022-07-20 22:27:55,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 22:27:55,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:55,144 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-20 22:27:55,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 22:27:55,144 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:55,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1963615586, now seen corresponding path program 1 times [2022-07-20 22:27:55,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:27:55,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128600004] [2022-07-20 22:27:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:55,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:27:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:27:55,164 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 22:27:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:27:55,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 22:27:55,205 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 22:27:55,206 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 22:27:55,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-20 22:27:55,211 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-20 22:27:55,215 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 22:27:55,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:27:55 BoogieIcfgContainer [2022-07-20 22:27:55,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 22:27:55,290 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 22:27:55,290 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 22:27:55,290 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 22:27:55,291 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:26:56" (3/4) ... [2022-07-20 22:27:55,294 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 22:27:55,294 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 22:27:55,294 INFO L158 Benchmark]: Toolchain (without parser) took 59580.91ms. Allocated memory was 88.1MB in the beginning and 243.3MB in the end (delta: 155.2MB). Free memory was 45.6MB in the beginning and 82.2MB in the end (delta: -36.6MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. [2022-07-20 22:27:55,294 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:27:55,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.13ms. Allocated memory is still 88.1MB. Free memory was 45.4MB in the beginning and 54.4MB in the end (delta: -9.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 22:27:55,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.31ms. Allocated memory is still 88.1MB. Free memory was 54.4MB in the beginning and 52.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 22:27:55,298 INFO L158 Benchmark]: Boogie Preprocessor took 29.48ms. Allocated memory is still 88.1MB. Free memory was 52.7MB in the beginning and 51.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 22:27:55,299 INFO L158 Benchmark]: RCFGBuilder took 510.41ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 51.0MB in the beginning and 91.6MB in the end (delta: -40.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2022-07-20 22:27:55,302 INFO L158 Benchmark]: TraceAbstraction took 58655.69ms. Allocated memory was 115.3MB in the beginning and 243.3MB in the end (delta: 127.9MB). Free memory was 91.1MB in the beginning and 83.2MB in the end (delta: 7.9MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. [2022-07-20 22:27:55,303 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 243.3MB. Free memory was 83.2MB in the beginning and 82.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:27:55,305 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 88.1MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.13ms. Allocated memory is still 88.1MB. Free memory was 45.4MB in the beginning and 54.4MB in the end (delta: -9.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.31ms. Allocated memory is still 88.1MB. Free memory was 54.4MB in the beginning and 52.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.48ms. Allocated memory is still 88.1MB. Free memory was 52.7MB in the beginning and 51.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 510.41ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 51.0MB in the beginning and 91.6MB in the end (delta: -40.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 58655.69ms. Allocated memory was 115.3MB in the beginning and 243.3MB in the end (delta: 127.9MB). Free memory was 91.1MB in the beginning and 83.2MB in the end (delta: 7.9MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 243.3MB. Free memory was 83.2MB in the beginning and 82.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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: 58.5s, OverallIterations: 32, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 42.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12632 SdHoareTripleChecker+Valid, 30.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12343 mSDsluCounter, 17541 SdHoareTripleChecker+Invalid, 24.9s 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, 13.7s 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.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 5797 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.1s 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-20 22:27:55,326 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-?-3598765 [2022-07-20 22:27:57,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:27:57,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:27:57,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:27:57,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:27:57,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:27:57,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:27:57,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:27:57,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:27:57,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:27:57,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:27:57,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:27:57,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:27:57,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:27:57,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:27:57,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:27:57,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:27:57,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:27:57,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:27:57,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:27:57,314 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:27:57,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:27:57,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:27:57,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:27:57,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:27:57,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:27:57,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:27:57,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:27:57,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:27:57,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:27:57,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:27:57,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:27:57,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:27:57,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:27:57,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:27:57,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:27:57,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:27:57,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:27:57,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:27:57,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:27:57,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:27:57,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:27:57,343 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-20 22:27:57,375 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:27:57,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:27:57,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:27:57,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:27:57,377 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:27:57,377 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:27:57,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:27:57,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:27:57,378 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:27:57,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:27:57,379 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:27:57,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:27:57,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:27:57,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:27:57,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:27:57,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:27:57,380 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 22:27:57,380 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 22:27:57,381 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 22:27:57,381 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:27:57,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:27:57,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:27:57,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:27:57,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:27:57,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:27:57,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:27:57,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:27:57,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:27:57,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:27:57,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:27:57,383 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 22:27:57,383 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 22:27:57,384 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:27:57,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:27:57,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:27:57,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 22:27:57,384 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-20 22:27:57,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:27:57,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:27:57,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:27:57,725 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:27:57,726 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:27:57,728 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-20 22:27:57,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2524e4c0d/fb378b4358124e87adf5e233f1c5552a/FLAG6306ca2e4 [2022-07-20 22:27:58,178 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:27:58,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-20 22:27:58,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2524e4c0d/fb378b4358124e87adf5e233f1c5552a/FLAG6306ca2e4 [2022-07-20 22:27:58,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2524e4c0d/fb378b4358124e87adf5e233f1c5552a [2022-07-20 22:27:58,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:27:58,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:27:58,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:27:58,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:27:58,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:27:58,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:27:58" (1/1) ... [2022-07-20 22:27:58,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc76cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58, skipping insertion in model container [2022-07-20 22:27:58,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:27:58" (1/1) ... [2022-07-20 22:27:58,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:27:58,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:27:58,408 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-20 22:27:58,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:27:58,527 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:27:58,539 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-20 22:27:58,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:27:58,596 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:27:58,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58 WrapperNode [2022-07-20 22:27:58,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:27:58,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:27:58,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:27:58,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:27:58,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58" (1/1) ... [2022-07-20 22:27:58,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58" (1/1) ... [2022-07-20 22:27:58,652 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2022-07-20 22:27:58,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:27:58,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:27:58,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:27:58,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:27:58,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58" (1/1) ... [2022-07-20 22:27:58,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58" (1/1) ... [2022-07-20 22:27:58,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58" (1/1) ... [2022-07-20 22:27:58,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58" (1/1) ... [2022-07-20 22:27:58,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58" (1/1) ... [2022-07-20 22:27:58,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58" (1/1) ... [2022-07-20 22:27:58,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58" (1/1) ... [2022-07-20 22:27:58,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:27:58,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:27:58,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:27:58,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:27:58,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58" (1/1) ... [2022-07-20 22:27:58,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:27:58,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:27:58,737 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-20 22:27:58,753 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-20 22:27:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:27:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 22:27:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-20 22:27:58,780 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-20 22:27:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:27:58,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:27:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-20 22:27:58,780 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-20 22:27:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-20 22:27:58,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-20 22:27:58,839 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:27:58,841 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:27:59,020 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:27:59,025 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:27:59,025 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 22:27:59,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:27:59 BoogieIcfgContainer [2022-07-20 22:27:59,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:27:59,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:27:59,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:27:59,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:27:59,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:27:58" (1/3) ... [2022-07-20 22:27:59,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e349bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:27:59, skipping insertion in model container [2022-07-20 22:27:59,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:27:58" (2/3) ... [2022-07-20 22:27:59,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e349bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:27:59, skipping insertion in model container [2022-07-20 22:27:59,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:27:59" (3/3) ... [2022-07-20 22:27:59,041 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-07-20 22:27:59,067 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:27:59,069 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:27:59,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:27:59,126 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@27ffcea0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19f2baea [2022-07-20 22:27:59,127 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:27:59,130 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-20 22:27:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 22:27:59,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:59,136 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-20 22:27:59,137 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:59,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:59,141 INFO L85 PathProgramCache]: Analyzing trace with hash 173410466, now seen corresponding path program 1 times [2022-07-20 22:27:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:27:59,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047365642] [2022-07-20 22:27:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:59,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:27:59,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:27:59,155 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-20 22:27:59,156 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-20 22:27:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:59,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 22:27:59,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:27:59,414 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-20 22:27:59,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:27:59,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:27:59,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047365642] [2022-07-20 22:27:59,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047365642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:27:59,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:27:59,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 22:27:59,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553137165] [2022-07-20 22:27:59,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:27:59,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 22:27:59,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:27:59,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 22:27:59,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 22:27:59,459 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-20 22:27:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:27:59,628 INFO L93 Difference]: Finished difference Result 130 states and 196 transitions. [2022-07-20 22:27:59,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:27:59,631 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-20 22:27:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:27:59,643 INFO L225 Difference]: With dead ends: 130 [2022-07-20 22:27:59,643 INFO L226 Difference]: Without dead ends: 71 [2022-07-20 22:27:59,647 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-20 22:27:59,651 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 22:27:59,654 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-20 22:27:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-20 22:27:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2022-07-20 22:27:59,701 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-20 22:27:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-07-20 22:27:59,706 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 31 [2022-07-20 22:27:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:27:59,707 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-07-20 22:27:59,707 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-20 22:27:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-07-20 22:27:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 22:27:59,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:27:59,711 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-20 22:27:59,725 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-20 22:27:59,924 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-20 22:27:59,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:27:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:27:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1707598935, now seen corresponding path program 1 times [2022-07-20 22:27:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:27:59,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124608760] [2022-07-20 22:27:59,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:27:59,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:27:59,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:27:59,928 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-20 22:27:59,929 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-20 22:27:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:27:59,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 22:27:59,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:28:00,067 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-20 22:28:00,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:28:00,146 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-20 22:28:00,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:28:00,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124608760] [2022-07-20 22:28:00,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124608760] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:28:00,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:28:00,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-07-20 22:28:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87617786] [2022-07-20 22:28:00,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:28:00,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 22:28:00,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:28:00,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 22:28:00,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:28:00,158 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-20 22:28:00,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:28:00,283 INFO L93 Difference]: Finished difference Result 121 states and 161 transitions. [2022-07-20 22:28:00,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:28:00,283 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-20 22:28:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:28:00,285 INFO L225 Difference]: With dead ends: 121 [2022-07-20 22:28:00,285 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 22:28:00,286 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-20 22:28:00,287 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 26 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:28:00,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 492 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:28:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 22:28:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2022-07-20 22:28:00,298 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-20 22:28:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2022-07-20 22:28:00,300 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 35 [2022-07-20 22:28:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:28:00,300 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2022-07-20 22:28:00,300 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-20 22:28:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2022-07-20 22:28:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 22:28:00,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:28:00,302 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-20 22:28:00,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 22:28:00,511 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-20 22:28:00,511 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:28:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:28:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1508244029, now seen corresponding path program 1 times [2022-07-20 22:28:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:28:00,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168506203] [2022-07-20 22:28:00,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:28:00,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:28:00,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:28:00,514 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-20 22:28:00,515 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-20 22:28:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:28:00,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 22:28:00,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:28:00,634 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-20 22:28:00,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:28:00,696 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-20 22:28:00,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:28:00,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168506203] [2022-07-20 22:28:00,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168506203] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:28:00,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:28:00,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-20 22:28:00,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11732652] [2022-07-20 22:28:00,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:28:00,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 22:28:00,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:28:00,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 22:28:00,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 22:28:00,701 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-20 22:28:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:28:00,789 INFO L93 Difference]: Finished difference Result 113 states and 150 transitions. [2022-07-20 22:28:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:28:00,790 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-20 22:28:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:28:00,795 INFO L225 Difference]: With dead ends: 113 [2022-07-20 22:28:00,796 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 22:28:00,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 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-20 22:28:00,798 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:28:00,800 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.1s Time] [2022-07-20 22:28:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 22:28:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2022-07-20 22:28:00,811 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-20 22:28:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2022-07-20 22:28:00,816 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 39 [2022-07-20 22:28:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:28:00,816 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2022-07-20 22:28:00,817 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-20 22:28:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-07-20 22:28:00,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 22:28:00,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:28:00,821 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-20 22:28:00,827 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-20 22:28:01,021 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-20 22:28:01,022 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:28:01,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:28:01,022 INFO L85 PathProgramCache]: Analyzing trace with hash -54729342, now seen corresponding path program 2 times [2022-07-20 22:28:01,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:28:01,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177900422] [2022-07-20 22:28:01,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:28:01,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:28:01,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:28:01,025 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-20 22:28:01,027 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-20 22:28:01,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 22:28:01,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:28:01,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 22:28:01,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:28:01,193 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-20 22:28:01,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:28:01,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:28:01,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177900422] [2022-07-20 22:28:01,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177900422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:28:01,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:28:01,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 22:28:01,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833372731] [2022-07-20 22:28:01,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:28:01,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 22:28:01,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:28:01,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 22:28:01,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:28:01,199 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-20 22:28:01,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:28:01,262 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2022-07-20 22:28:01,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:28:01,263 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-20 22:28:01,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:28:01,267 INFO L225 Difference]: With dead ends: 96 [2022-07-20 22:28:01,267 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 22:28:01,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 22:28:01,273 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-20 22:28:01,274 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-20 22:28:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 22:28:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2022-07-20 22:28:01,290 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-20 22:28:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2022-07-20 22:28:01,291 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 39 [2022-07-20 22:28:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:28:01,293 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2022-07-20 22:28:01,294 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-20 22:28:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-07-20 22:28:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 22:28:01,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:28:01,300 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-20 22:28:01,311 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-20 22:28:01,508 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-20 22:28:01,509 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:28:01,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:28:01,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2528960, now seen corresponding path program 1 times [2022-07-20 22:28:01,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:28:01,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829258433] [2022-07-20 22:28:01,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:28:01,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:28:01,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:28:01,511 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-20 22:28:01,517 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-20 22:28:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:28:01,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 22:28:01,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:28:01,641 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-20 22:28:01,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:28:01,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:28:01,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829258433] [2022-07-20 22:28:01,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829258433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:28:01,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:28:01,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 22:28:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086857137] [2022-07-20 22:28:01,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:28:01,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 22:28:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:28:01,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 22:28:01,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:28:01,644 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-20 22:28:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:28:01,703 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-07-20 22:28:01,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:28:01,704 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-20 22:28:01,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:28:01,706 INFO L225 Difference]: With dead ends: 96 [2022-07-20 22:28:01,706 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 22:28:01,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 22:28:01,707 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-20 22:28:01,708 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-20 22:28:01,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 22:28:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-07-20 22:28:01,724 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-20 22:28:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2022-07-20 22:28:01,725 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 39 [2022-07-20 22:28:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:28:01,725 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2022-07-20 22:28:01,726 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-20 22:28:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2022-07-20 22:28:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 22:28:01,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:28:01,727 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-20 22:28:01,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 22:28:01,939 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-20 22:28:01,940 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:28:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:28:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1837968146, now seen corresponding path program 1 times [2022-07-20 22:28:01,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:28:01,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471337423] [2022-07-20 22:28:01,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:28:01,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:28:01,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:28:01,942 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-20 22:28:01,943 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-20 22:28:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:28:02,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 22:28:02,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:28:02,108 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-20 22:28:02,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:28:02,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:28:02,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471337423] [2022-07-20 22:28:02,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471337423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:28:02,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:28:02,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 22:28:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072152739] [2022-07-20 22:28:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:28:02,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:28:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:28:02,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:28:02,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:28:02,110 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-20 22:28:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:28:02,336 INFO L93 Difference]: Finished difference Result 126 states and 165 transitions. [2022-07-20 22:28:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:28:02,337 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-20 22:28:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:28:02,338 INFO L225 Difference]: With dead ends: 126 [2022-07-20 22:28:02,338 INFO L226 Difference]: Without dead ends: 119 [2022-07-20 22:28:02,339 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-20 22:28:02,339 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:28:02,339 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.2s Time] [2022-07-20 22:28:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-20 22:28:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-07-20 22:28:02,348 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-20 22:28:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-07-20 22:28:02,350 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 44 [2022-07-20 22:28:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:28:02,350 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-07-20 22:28:02,350 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-20 22:28:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-07-20 22:28:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 22:28:02,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:28:02,352 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-20 22:28:02,366 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-20 22:28:02,560 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-20 22:28:02,561 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:28:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:28:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash 595859751, now seen corresponding path program 1 times [2022-07-20 22:28:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:28:02,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401285409] [2022-07-20 22:28:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:28:02,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:28:02,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:28:02,563 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-20 22:28:02,564 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-20 22:28:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:28:02,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 22:28:02,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:28:02,666 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-20 22:28:02,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:28:02,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:28:02,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401285409] [2022-07-20 22:28:02,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401285409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:28:02,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:28:02,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 22:28:02,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118373983] [2022-07-20 22:28:02,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:28:02,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 22:28:02,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:28:02,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 22:28:02,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:28:02,669 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-20 22:28:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:28:02,767 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2022-07-20 22:28:02,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:28:02,768 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-20 22:28:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:28:02,769 INFO L225 Difference]: With dead ends: 164 [2022-07-20 22:28:02,769 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 22:28:02,770 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-20 22:28:02,770 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:28:02,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 518 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:28:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 22:28:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2022-07-20 22:28:02,785 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-20 22:28:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2022-07-20 22:28:02,787 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 49 [2022-07-20 22:28:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:28:02,787 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2022-07-20 22:28:02,787 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-20 22:28:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2022-07-20 22:28:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 22:28:02,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:28:02,788 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-20 22:28:02,796 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-20 22:28:02,996 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-20 22:28:02,996 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:28:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:28:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1849173563, now seen corresponding path program 1 times [2022-07-20 22:28:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:28:02,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813143780] [2022-07-20 22:28:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:28:02,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:28:02,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:28:02,998 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-20 22:28:03,004 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-20 22:28:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:28:03,046 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 22:28:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 22:28:03,103 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-20 22:28:03,103 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 22:28:03,104 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 22:28:03,121 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-20 22:28:03,307 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-20 22:28:03,310 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-07-20 22:28:03,313 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 22:28:03,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:28:03 BoogieIcfgContainer [2022-07-20 22:28:03,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 22:28:03,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 22:28:03,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 22:28:03,371 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 22:28:03,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:27:59" (3/4) ... [2022-07-20 22:28:03,373 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-20 22:28:03,420 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 22:28:03,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 22:28:03,421 INFO L158 Benchmark]: Toolchain (without parser) took 5216.52ms. Allocated memory was 50.3MB in the beginning and 86.0MB in the end (delta: 35.7MB). Free memory was 24.9MB in the beginning and 64.4MB in the end (delta: -39.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:28:03,422 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 50.3MB. Free memory was 31.9MB in the beginning and 31.9MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:28:03,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.83ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 24.7MB in the beginning and 45.1MB in the end (delta: -20.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-20 22:28:03,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.04ms. Allocated memory is still 65.0MB. Free memory was 45.1MB in the beginning and 43.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:28:03,422 INFO L158 Benchmark]: Boogie Preprocessor took 52.55ms. Allocated memory is still 65.0MB. Free memory was 43.5MB in the beginning and 42.1MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 22:28:03,423 INFO L158 Benchmark]: RCFGBuilder took 319.11ms. Allocated memory is still 65.0MB. Free memory was 42.0MB in the beginning and 42.5MB in the end (delta: -570.8kB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-07-20 22:28:03,423 INFO L158 Benchmark]: TraceAbstraction took 4334.52ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 42.1MB in the beginning and 67.1MB in the end (delta: -25.1MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2022-07-20 22:28:03,423 INFO L158 Benchmark]: Witness Printer took 49.98ms. Allocated memory is still 86.0MB. Free memory was 67.1MB in the beginning and 64.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 22:28:03,425 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.18ms. Allocated memory is still 50.3MB. Free memory was 31.9MB in the beginning and 31.9MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.83ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 24.7MB in the beginning and 45.1MB in the end (delta: -20.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.04ms. Allocated memory is still 65.0MB. Free memory was 45.1MB in the beginning and 43.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.55ms. Allocated memory is still 65.0MB. Free memory was 43.5MB in the beginning and 42.1MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 319.11ms. Allocated memory is still 65.0MB. Free memory was 42.0MB in the beginning and 42.5MB in the end (delta: -570.8kB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4334.52ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 42.1MB in the beginning and 67.1MB in the end (delta: -25.1MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * Witness Printer took 49.98ms. Allocated memory is still 86.0MB. Free memory was 67.1MB in the beginning and 64.4MB 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: 4.2s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 3230 SdHoareTripleChecker+Invalid, 0.4s 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.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 95 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s 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-20 22:28:03,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE