./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 791161d1 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-?-791161d [2022-07-22 11:04:48,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:04:48,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:04:48,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:04:48,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:04:48,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:04:48,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:04:48,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:04:48,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:04:48,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:04:48,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:04:48,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:04:48,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:04:48,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:04:48,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:04:48,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:04:48,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:04:48,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:04:48,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:04:48,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:04:48,404 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:04:48,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:04:48,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:04:48,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:04:48,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:04:48,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:04:48,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:04:48,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:04:48,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:04:48,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:04:48,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:04:48,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:04:48,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:04:48,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:04:48,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:04:48,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:04:48,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:04:48,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:04:48,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:04:48,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:04:48,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:04:48,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:04:48,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 11:04:48,453 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:04:48,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:04:48,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:04:48,454 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:04:48,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:04:48,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:04:48,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:04:48,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:04:48,456 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:04:48,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:04:48,457 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:04:48,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:04:48,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:04:48,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:04:48,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:04:48,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:04:48,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:04:48,458 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:04:48,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:04:48,458 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:04:48,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:04:48,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:04:48,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:04:48,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:04:48,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:04:48,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:04:48,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:04:48,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:04:48,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:04:48,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:04:48,461 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:04:48,461 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:04:48,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:04:48,461 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-22 11:04:48,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:04:48,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:04:48,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:04:48,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:04:48,685 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:04:48,686 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-22 11:04:48,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc6774a0b/9c5ab02143fc465d95d16390760a4b9f/FLAG0ae4131cf [2022-07-22 11:04:49,150 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:04:49,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-22 11:04:49,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc6774a0b/9c5ab02143fc465d95d16390760a4b9f/FLAG0ae4131cf [2022-07-22 11:04:49,173 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc6774a0b/9c5ab02143fc465d95d16390760a4b9f [2022-07-22 11:04:49,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:04:49,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:04:49,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:04:49,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:04:49,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:04:49,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:04:49" (1/1) ... [2022-07-22 11:04:49,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65b9e8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49, skipping insertion in model container [2022-07-22 11:04:49,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:04:49" (1/1) ... [2022-07-22 11:04:49,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:04:49,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:04:49,342 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-22 11:04:49,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:04:49,391 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:04:49,401 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-22 11:04:49,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:04:49,441 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:04:49,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49 WrapperNode [2022-07-22 11:04:49,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:04:49,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:04:49,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:04:49,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:04:49,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49" (1/1) ... [2022-07-22 11:04:49,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49" (1/1) ... [2022-07-22 11:04:49,470 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-07-22 11:04:49,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:04:49,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:04:49,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:04:49,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:04:49,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49" (1/1) ... [2022-07-22 11:04:49,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49" (1/1) ... [2022-07-22 11:04:49,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49" (1/1) ... [2022-07-22 11:04:49,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49" (1/1) ... [2022-07-22 11:04:49,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49" (1/1) ... [2022-07-22 11:04:49,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49" (1/1) ... [2022-07-22 11:04:49,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49" (1/1) ... [2022-07-22 11:04:49,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:04:49,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:04:49,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:04:49,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:04:49,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49" (1/1) ... [2022-07-22 11:04:49,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:04:49,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:49,543 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-22 11:04:49,545 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-22 11:04:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:04:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:04:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-22 11:04:49,568 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-22 11:04:49,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:04:49,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:04:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-22 11:04:49,569 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-22 11:04:49,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 11:04:49,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 11:04:49,628 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:04:49,629 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:04:49,892 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:04:49,899 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:04:49,899 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 11:04:49,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:04:49 BoogieIcfgContainer [2022-07-22 11:04:49,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:04:49,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:04:49,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:04:49,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:04:49,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:04:49" (1/3) ... [2022-07-22 11:04:49,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45882024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:04:49, skipping insertion in model container [2022-07-22 11:04:49,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:04:49" (2/3) ... [2022-07-22 11:04:49,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45882024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:04:49, skipping insertion in model container [2022-07-22 11:04:49,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:04:49" (3/3) ... [2022-07-22 11:04:49,908 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-07-22 11:04:49,920 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:04:49,920 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:04:49,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:04:49,974 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@5a7c424e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4aeeb3f8 [2022-07-22 11:04:49,975 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:04:49,992 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-22 11:04:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 11:04:50,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:50,006 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-22 11:04:50,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash 176765495, now seen corresponding path program 1 times [2022-07-22 11:04:50,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:50,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329851530] [2022-07-22 11:04:50,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:50,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:50,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:50,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:50,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:04:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:50,329 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-22 11:04:50,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:50,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329851530] [2022-07-22 11:04:50,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329851530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:04:50,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:04:50,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:04:50,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861848166] [2022-07-22 11:04:50,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:04:50,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:04:50,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:50,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:04:50,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:04:50,374 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-22 11:04:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:50,449 INFO L93 Difference]: Finished difference Result 181 states and 305 transitions. [2022-07-22 11:04:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:04:50,451 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-22 11:04:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:50,459 INFO L225 Difference]: With dead ends: 181 [2022-07-22 11:04:50,459 INFO L226 Difference]: Without dead ends: 92 [2022-07-22 11:04:50,463 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-22 11:04:50,465 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-22 11:04:50,471 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-22 11:04:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-22 11:04:50,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2022-07-22 11:04:50,505 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-22 11:04:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2022-07-22 11:04:50,509 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 37 [2022-07-22 11:04:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:50,509 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2022-07-22 11:04:50,510 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-22 11:04:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2022-07-22 11:04:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 11:04:50,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:50,512 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-22 11:04:50,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:04:50,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:50,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1174822094, now seen corresponding path program 1 times [2022-07-22 11:04:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:50,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406025688] [2022-07-22 11:04:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:50,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:50,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:50,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:04:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:50,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:04:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:50,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 11:04:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:50,803 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-22 11:04:50,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:50,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406025688] [2022-07-22 11:04:50,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406025688] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:50,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790207892] [2022-07-22 11:04:50,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:50,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:50,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:50,806 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-22 11:04:50,815 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-22 11:04:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:50,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 11:04:50,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:04:51,147 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-22 11:04:51,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:04:51,417 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-22 11:04:51,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790207892] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:04:51,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:04:51,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 24 [2022-07-22 11:04:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639453657] [2022-07-22 11:04:51,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:04:51,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 11:04:51,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:51,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 11:04:51,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2022-07-22 11:04:51,422 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-22 11:04:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:54,273 INFO L93 Difference]: Finished difference Result 419 states and 669 transitions. [2022-07-22 11:04:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 11:04:54,274 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-22 11:04:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:54,279 INFO L225 Difference]: With dead ends: 419 [2022-07-22 11:04:54,279 INFO L226 Difference]: Without dead ends: 338 [2022-07-22 11:04:54,282 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-22 11:04:54,283 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-22 11:04:54,284 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-22 11:04:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-22 11:04:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 116. [2022-07-22 11:04:54,320 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-22 11:04:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2022-07-22 11:04:54,322 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 44 [2022-07-22 11:04:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:54,322 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2022-07-22 11:04:54,323 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-22 11:04:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2022-07-22 11:04:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 11:04:54,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:54,326 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-22 11:04:54,352 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-22 11:04:54,549 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-22 11:04:54,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:54,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:54,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1191712414, now seen corresponding path program 1 times [2022-07-22 11:04:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:54,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898162883] [2022-07-22 11:04:54,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:54,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:04:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:54,642 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-22 11:04:54,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:54,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898162883] [2022-07-22 11:04:54,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898162883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:04:54,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:04:54,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:04:54,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762859304] [2022-07-22 11:04:54,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:04:54,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:04:54,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:54,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:04:54,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:04:54,647 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-22 11:04:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:54,776 INFO L93 Difference]: Finished difference Result 212 states and 306 transitions. [2022-07-22 11:04:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:04:54,777 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-22 11:04:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:54,782 INFO L225 Difference]: With dead ends: 212 [2022-07-22 11:04:54,782 INFO L226 Difference]: Without dead ends: 132 [2022-07-22 11:04:54,783 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-22 11:04:54,786 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-22 11:04:54,788 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-22 11:04:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-22 11:04:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 117. [2022-07-22 11:04:54,814 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-22 11:04:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2022-07-22 11:04:54,816 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 43 [2022-07-22 11:04:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:54,817 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2022-07-22 11:04:54,817 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-22 11:04:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2022-07-22 11:04:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 11:04:54,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:54,824 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-22 11:04:54,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 11:04:54,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:54,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash 186942930, now seen corresponding path program 1 times [2022-07-22 11:04:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:54,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459251149] [2022-07-22 11:04:54,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:54,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:54,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:04:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:55,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:04:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:55,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 11:04:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 11:04:55,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:55,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459251149] [2022-07-22 11:04:55,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459251149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:04:55,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:04:55,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-22 11:04:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929717798] [2022-07-22 11:04:55,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:04:55,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 11:04:55,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:55,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 11:04:55,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2022-07-22 11:04:55,178 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-22 11:04:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:56,771 INFO L93 Difference]: Finished difference Result 250 states and 362 transitions. [2022-07-22 11:04:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 11:04:56,773 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-22 11:04:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:56,775 INFO L225 Difference]: With dead ends: 250 [2022-07-22 11:04:56,775 INFO L226 Difference]: Without dead ends: 242 [2022-07-22 11:04:56,776 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-22 11:04:56,777 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-22 11:04:56,777 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-22 11:04:56,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-22 11:04:56,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 122. [2022-07-22 11:04:56,804 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-22 11:04:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 173 transitions. [2022-07-22 11:04:56,807 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 173 transitions. Word has length 44 [2022-07-22 11:04:56,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:56,808 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 173 transitions. [2022-07-22 11:04:56,808 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-22 11:04:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 173 transitions. [2022-07-22 11:04:56,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 11:04:56,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:56,812 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-22 11:04:56,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 11:04:56,812 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:56,813 INFO L85 PathProgramCache]: Analyzing trace with hash -407484938, now seen corresponding path program 1 times [2022-07-22 11:04:56,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:56,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197455904] [2022-07-22 11:04:56,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:56,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:56,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:04:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:56,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:04:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:56,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 11:04:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:56,888 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-22 11:04:56,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:56,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197455904] [2022-07-22 11:04:56,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197455904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:04:56,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:04:56,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 11:04:56,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100301455] [2022-07-22 11:04:56,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:04:56,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 11:04:56,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:56,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 11:04:56,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:04:56,893 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-22 11:04:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:57,343 INFO L93 Difference]: Finished difference Result 179 states and 253 transitions. [2022-07-22 11:04:57,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 11:04:57,343 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-22 11:04:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:57,345 INFO L225 Difference]: With dead ends: 179 [2022-07-22 11:04:57,345 INFO L226 Difference]: Without dead ends: 168 [2022-07-22 11:04:57,345 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-22 11:04:57,346 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.4s IncrementalHoareTripleChecker+Time [2022-07-22 11:04:57,347 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.4s Time] [2022-07-22 11:04:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-22 11:04:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2022-07-22 11:04:57,356 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-22 11:04:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2022-07-22 11:04:57,358 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 46 [2022-07-22 11:04:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:57,358 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2022-07-22 11:04:57,359 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-22 11:04:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2022-07-22 11:04:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 11:04:57,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:57,360 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-22 11:04:57,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 11:04:57,361 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:57,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:57,361 INFO L85 PathProgramCache]: Analyzing trace with hash -167909170, now seen corresponding path program 1 times [2022-07-22 11:04:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:57,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582067046] [2022-07-22 11:04:57,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:57,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:57,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:57,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:04:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:57,439 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-22 11:04:57,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:57,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582067046] [2022-07-22 11:04:57,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582067046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:04:57,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:04:57,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 11:04:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749236592] [2022-07-22 11:04:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:04:57,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 11:04:57,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:57,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 11:04:57,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-22 11:04:57,442 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-22 11:04:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:04:57,779 INFO L93 Difference]: Finished difference Result 222 states and 313 transitions. [2022-07-22 11:04:57,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 11:04:57,779 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-22 11:04:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:04:57,781 INFO L225 Difference]: With dead ends: 222 [2022-07-22 11:04:57,781 INFO L226 Difference]: Without dead ends: 166 [2022-07-22 11:04:57,781 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-22 11:04:57,782 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-22 11:04:57,782 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-22 11:04:57,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-22 11:04:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2022-07-22 11:04:57,795 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-22 11:04:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2022-07-22 11:04:57,797 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 46 [2022-07-22 11:04:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:04:57,798 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2022-07-22 11:04:57,799 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-22 11:04:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2022-07-22 11:04:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 11:04:57,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:04:57,800 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-22 11:04:57,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 11:04:57,801 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:04:57,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:04:57,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1626225281, now seen corresponding path program 1 times [2022-07-22 11:04:57,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:04:57,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173285240] [2022-07-22 11:04:57,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:57,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:04:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:57,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:04:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:57,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:04:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:04:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:57,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 11:04:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:57,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 11:04:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:58,024 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-22 11:04:58,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:04:58,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173285240] [2022-07-22 11:04:58,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173285240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:04:58,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629399289] [2022-07-22 11:04:58,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:04:58,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:04:58,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:04:58,027 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-22 11:04:58,047 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-22 11:04:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:04:58,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-22 11:04:58,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:04:58,375 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-22 11:04:58,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:04:58,772 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-22 11:04:58,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629399289] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:04:58,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:04:58,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 34 [2022-07-22 11:04:58,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168201111] [2022-07-22 11:04:58,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:04:58,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 11:04:58,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:04:58,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 11:04:58,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 11:04:58,775 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-22 11:05:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:04,832 INFO L93 Difference]: Finished difference Result 483 states and 769 transitions. [2022-07-22 11:05:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-22 11:05:04,839 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-22 11:05:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:04,844 INFO L225 Difference]: With dead ends: 483 [2022-07-22 11:05:04,845 INFO L226 Difference]: Without dead ends: 472 [2022-07-22 11:05:04,847 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-22 11:05:04,848 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.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:04,849 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.2s Time] [2022-07-22 11:05:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-22 11:05:04,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 164. [2022-07-22 11:05:04,871 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-22 11:05:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2022-07-22 11:05:04,873 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 48 [2022-07-22 11:05:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:04,873 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2022-07-22 11:05:04,874 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-22 11:05:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2022-07-22 11:05:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 11:05:04,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:04,875 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-22 11:05:04,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 11:05:05,091 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-22 11:05:05,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:05,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:05,092 INFO L85 PathProgramCache]: Analyzing trace with hash 976965441, now seen corresponding path program 2 times [2022-07-22 11:05:05,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:05,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124490974] [2022-07-22 11:05:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:05,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:05,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:05,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:05,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 11:05:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:05,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 11:05:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:05,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 11:05:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:05,327 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-22 11:05:05,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:05,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124490974] [2022-07-22 11:05:05,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124490974] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:05,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221545469] [2022-07-22 11:05:05,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 11:05:05,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:05,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:05,336 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-22 11:05:05,337 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-22 11:05:05,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 11:05:05,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:05:05,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 11:05:05,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:05,535 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-22 11:05:05,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:05,829 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-22 11:05:05,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221545469] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:05,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:05,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-07-22 11:05:05,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625324831] [2022-07-22 11:05:05,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:05,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-22 11:05:05,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:05,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-22 11:05:05,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2022-07-22 11:05:05,831 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-22 11:05:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:08,892 INFO L93 Difference]: Finished difference Result 348 states and 670 transitions. [2022-07-22 11:05:08,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-22 11:05:08,893 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-22 11:05:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:08,896 INFO L225 Difference]: With dead ends: 348 [2022-07-22 11:05:08,896 INFO L226 Difference]: Without dead ends: 341 [2022-07-22 11:05:08,898 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-22 11:05:08,898 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.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:08,899 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.0s Time] [2022-07-22 11:05:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-22 11:05:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 172. [2022-07-22 11:05:08,923 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-22 11:05:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 272 transitions. [2022-07-22 11:05:08,926 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 272 transitions. Word has length 48 [2022-07-22 11:05:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:08,927 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 272 transitions. [2022-07-22 11:05:08,927 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-22 11:05:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 272 transitions. [2022-07-22 11:05:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 11:05:08,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:08,929 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-22 11:05:08,947 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-22 11:05:09,135 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-22 11:05:09,135 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:09,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:09,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1260029991, now seen corresponding path program 1 times [2022-07-22 11:05:09,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:09,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057712616] [2022-07-22 11:05:09,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:09,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:09,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:09,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:09,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:05:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 11:05:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:09,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 11:05:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:09,294 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-22 11:05:09,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:09,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057712616] [2022-07-22 11:05:09,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057712616] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:09,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351951878] [2022-07-22 11:05:09,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:09,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:09,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:09,300 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-22 11:05:09,301 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-22 11:05:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:09,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-22 11:05:09,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:09,436 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-22 11:05:09,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:09,682 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-22 11:05:09,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351951878] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:09,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:09,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 24 [2022-07-22 11:05:09,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895585137] [2022-07-22 11:05:09,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:09,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 11:05:09,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:09,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 11:05:09,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-22 11:05:09,685 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-22 11:05:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:11,580 INFO L93 Difference]: Finished difference Result 342 states and 591 transitions. [2022-07-22 11:05:11,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-22 11:05:11,581 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-22 11:05:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:11,583 INFO L225 Difference]: With dead ends: 342 [2022-07-22 11:05:11,583 INFO L226 Difference]: Without dead ends: 331 [2022-07-22 11:05:11,584 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-22 11:05:11,585 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.5s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:11,585 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.5s Time] [2022-07-22 11:05:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-22 11:05:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 172. [2022-07-22 11:05:11,601 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-22 11:05:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 272 transitions. [2022-07-22 11:05:11,603 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 272 transitions. Word has length 50 [2022-07-22 11:05:11,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:11,603 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 272 transitions. [2022-07-22 11:05:11,604 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-22 11:05:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 272 transitions. [2022-07-22 11:05:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 11:05:11,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:11,605 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-22 11:05:11,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 11:05:11,819 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-22 11:05:11,819 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:11,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1462321561, now seen corresponding path program 1 times [2022-07-22 11:05:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:11,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062343675] [2022-07-22 11:05:11,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:11,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:11,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:11,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 11:05:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:11,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 11:05:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 11:05:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:12,010 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-22 11:05:12,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:12,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062343675] [2022-07-22 11:05:12,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062343675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:12,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917769049] [2022-07-22 11:05:12,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:12,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:12,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:12,011 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-22 11:05:12,012 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-22 11:05:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:12,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-22 11:05:12,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:12,211 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-22 11:05:12,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:12,504 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-22 11:05:12,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917769049] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:12,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:12,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 31 [2022-07-22 11:05:12,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981365763] [2022-07-22 11:05:12,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:12,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-22 11:05:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:12,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-22 11:05:12,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=861, Unknown=0, NotChecked=0, Total=930 [2022-07-22 11:05:12,506 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-22 11:05:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:15,365 INFO L93 Difference]: Finished difference Result 343 states and 636 transitions. [2022-07-22 11:05:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-22 11:05:15,366 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-22 11:05:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:15,368 INFO L225 Difference]: With dead ends: 343 [2022-07-22 11:05:15,368 INFO L226 Difference]: Without dead ends: 320 [2022-07-22 11:05:15,370 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-22 11:05:15,371 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 792 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 4569 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 4569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:15,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 499 Invalid, 4726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 4569 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-22 11:05:15,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-22 11:05:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 180. [2022-07-22 11:05:15,390 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-22 11:05:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 289 transitions. [2022-07-22 11:05:15,392 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 289 transitions. Word has length 50 [2022-07-22 11:05:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:15,392 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 289 transitions. [2022-07-22 11:05:15,393 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-22 11:05:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 289 transitions. [2022-07-22 11:05:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 11:05:15,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:15,394 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-22 11:05:15,421 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-22 11:05:15,616 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-22 11:05:15,616 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:15,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:15,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1556864061, now seen corresponding path program 1 times [2022-07-22 11:05:15,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:15,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745341241] [2022-07-22 11:05:15,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:15,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:15,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:15,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:15,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:05:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:15,669 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-22 11:05:15,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:15,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745341241] [2022-07-22 11:05:15,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745341241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:15,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:15,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:05:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659421652] [2022-07-22 11:05:15,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:15,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:05:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:15,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:05:15,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:05:15,673 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-22 11:05:15,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:15,752 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2022-07-22 11:05:15,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:05:15,757 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-22 11:05:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:15,758 INFO L225 Difference]: With dead ends: 304 [2022-07-22 11:05:15,758 INFO L226 Difference]: Without dead ends: 188 [2022-07-22 11:05:15,760 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-22 11:05:15,760 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:15,761 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-22 11:05:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-22 11:05:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2022-07-22 11:05:15,775 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-22 11:05:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 288 transitions. [2022-07-22 11:05:15,777 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 288 transitions. Word has length 50 [2022-07-22 11:05:15,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:15,778 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 288 transitions. [2022-07-22 11:05:15,778 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-22 11:05:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 288 transitions. [2022-07-22 11:05:15,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-22 11:05:15,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:15,779 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-22 11:05:15,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 11:05:15,780 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:15,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1943903020, now seen corresponding path program 1 times [2022-07-22 11:05:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:15,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557217704] [2022-07-22 11:05:15,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:15,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:15,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:15,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:15,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:05:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:15,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 11:05:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:15,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 11:05:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:15,840 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-22 11:05:15,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:15,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557217704] [2022-07-22 11:05:15,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557217704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:15,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:15,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 11:05:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106907344] [2022-07-22 11:05:15,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:15,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 11:05:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:15,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 11:05:15,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:05:15,843 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-22 11:05:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:16,103 INFO L93 Difference]: Finished difference Result 426 states and 705 transitions. [2022-07-22 11:05:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:05:16,104 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-22 11:05:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:16,105 INFO L225 Difference]: With dead ends: 426 [2022-07-22 11:05:16,105 INFO L226 Difference]: Without dead ends: 263 [2022-07-22 11:05:16,107 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-22 11:05:16,107 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.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:16,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 183 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 11:05:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-22 11:05:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 181. [2022-07-22 11:05:16,125 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-22 11:05:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 289 transitions. [2022-07-22 11:05:16,127 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 289 transitions. Word has length 52 [2022-07-22 11:05:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:16,127 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 289 transitions. [2022-07-22 11:05:16,127 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-22 11:05:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2022-07-22 11:05:16,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-22 11:05:16,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:16,129 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-22 11:05:16,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 11:05:16,129 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:16,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:16,129 INFO L85 PathProgramCache]: Analyzing trace with hash 380344415, now seen corresponding path program 1 times [2022-07-22 11:05:16,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:16,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682912772] [2022-07-22 11:05:16,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:16,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:16,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:16,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:16,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:05:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:16,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 11:05:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:16,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 11:05:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:16,286 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-22 11:05:16,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:16,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682912772] [2022-07-22 11:05:16,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682912772] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:16,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796051719] [2022-07-22 11:05:16,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:16,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:16,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:16,292 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-22 11:05:16,302 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-22 11:05:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:16,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 11:05:16,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:16,506 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-22 11:05:16,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:16,886 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-22 11:05:16,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796051719] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:16,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:16,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2022-07-22 11:05:16,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684928813] [2022-07-22 11:05:16,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:16,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-22 11:05:16,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:16,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-22 11:05:16,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2022-07-22 11:05:16,888 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-22 11:05:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:23,241 INFO L93 Difference]: Finished difference Result 673 states and 1221 transitions. [2022-07-22 11:05:23,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-22 11:05:23,242 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-22 11:05:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:23,245 INFO L225 Difference]: With dead ends: 673 [2022-07-22 11:05:23,245 INFO L226 Difference]: Without dead ends: 553 [2022-07-22 11:05:23,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=836, Invalid=8284, Unknown=0, NotChecked=0, Total=9120 [2022-07-22 11:05:23,249 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 1059 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 10055 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:23,250 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.3s Time] [2022-07-22 11:05:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-07-22 11:05:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 226. [2022-07-22 11:05:23,309 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-22 11:05:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 409 transitions. [2022-07-22 11:05:23,311 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 409 transitions. Word has length 53 [2022-07-22 11:05:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:23,312 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 409 transitions. [2022-07-22 11:05:23,312 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-22 11:05:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 409 transitions. [2022-07-22 11:05:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-22 11:05:23,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:23,315 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-22 11:05:23,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 11:05:23,538 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-22 11:05:23,538 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:23,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:23,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2040511084, now seen corresponding path program 1 times [2022-07-22 11:05:23,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:23,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095636483] [2022-07-22 11:05:23,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:23,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:23,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:23,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:23,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:05:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:23,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 11:05:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:23,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 11:05:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:23,611 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-22 11:05:23,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:23,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095636483] [2022-07-22 11:05:23,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095636483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:23,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752486778] [2022-07-22 11:05:23,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:23,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:23,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:23,613 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-22 11:05:23,623 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-22 11:05:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:23,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 11:05:23,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:23,778 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-22 11:05:23,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:23,937 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-22 11:05:23,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752486778] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:23,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:23,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 20 [2022-07-22 11:05:23,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962440561] [2022-07-22 11:05:23,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:23,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 11:05:23,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:23,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 11:05:23,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-22 11:05:23,939 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-22 11:05:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:25,930 INFO L93 Difference]: Finished difference Result 607 states and 1268 transitions. [2022-07-22 11:05:25,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 11:05:25,931 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-22 11:05:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:25,935 INFO L225 Difference]: With dead ends: 607 [2022-07-22 11:05:25,935 INFO L226 Difference]: Without dead ends: 396 [2022-07-22 11:05:25,938 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-22 11:05:25,939 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 421 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 3835 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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-22 11:05:25,939 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-22 11:05:25,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-22 11:05:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 257. [2022-07-22 11:05:25,973 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-22 11:05:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 495 transitions. [2022-07-22 11:05:25,976 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 495 transitions. Word has length 53 [2022-07-22 11:05:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:25,976 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 495 transitions. [2022-07-22 11:05:25,976 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-22 11:05:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 495 transitions. [2022-07-22 11:05:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-22 11:05:25,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:25,978 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-22 11:05:26,004 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-22 11:05:26,188 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-22 11:05:26,189 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:26,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1827539848, now seen corresponding path program 1 times [2022-07-22 11:05:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:26,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124772052] [2022-07-22 11:05:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:26,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:26,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:05:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:26,272 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-22 11:05:26,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:26,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124772052] [2022-07-22 11:05:26,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124772052] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:26,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712852121] [2022-07-22 11:05:26,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:26,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:26,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:26,280 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-22 11:05:26,281 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-22 11:05:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:26,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 11:05:26,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:26,434 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-22 11:05:26,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:26,489 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-22 11:05:26,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712852121] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:26,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:26,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-07-22 11:05:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090185073] [2022-07-22 11:05:26,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:26,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 11:05:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:26,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 11:05:26,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-22 11:05:26,493 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-22 11:05:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:27,392 INFO L93 Difference]: Finished difference Result 612 states and 1350 transitions. [2022-07-22 11:05:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 11:05:27,393 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-22 11:05:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:27,398 INFO L225 Difference]: With dead ends: 612 [2022-07-22 11:05:27,398 INFO L226 Difference]: Without dead ends: 495 [2022-07-22 11:05:27,400 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-22 11:05:27,400 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.7s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:27,400 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.7s Time] [2022-07-22 11:05:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-07-22 11:05:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 269. [2022-07-22 11:05:27,457 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-22 11:05:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 495 transitions. [2022-07-22 11:05:27,460 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 495 transitions. Word has length 53 [2022-07-22 11:05:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:27,461 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 495 transitions. [2022-07-22 11:05:27,461 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-22 11:05:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 495 transitions. [2022-07-22 11:05:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-22 11:05:27,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:27,463 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-22 11:05:27,489 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-22 11:05:27,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 11:05:27,679 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2006096899, now seen corresponding path program 1 times [2022-07-22 11:05:27,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:27,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198469146] [2022-07-22 11:05:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:27,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:27,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:27,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:27,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 11:05:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:27,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 11:05:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:27,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 11:05:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:27,731 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-22 11:05:27,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:27,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198469146] [2022-07-22 11:05:27,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198469146] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:27,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963828799] [2022-07-22 11:05:27,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:27,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:27,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:27,734 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-22 11:05:27,750 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-22 11:05:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:27,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:05:27,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:27,809 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-22 11:05:27,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:05:27,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963828799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:27,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 11:05:27,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-22 11:05:27,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057768435] [2022-07-22 11:05:27,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:27,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:05:27,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:27,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:05:27,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:05:27,812 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-22 11:05:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:27,872 INFO L93 Difference]: Finished difference Result 496 states and 887 transitions. [2022-07-22 11:05:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 11:05:27,873 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-22 11:05:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:27,875 INFO L225 Difference]: With dead ends: 496 [2022-07-22 11:05:27,875 INFO L226 Difference]: Without dead ends: 276 [2022-07-22 11:05:27,878 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-22 11:05:27,878 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-22 11:05:27,878 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-22 11:05:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-22 11:05:27,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2022-07-22 11:05:27,910 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-22 11:05:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 497 transitions. [2022-07-22 11:05:27,913 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 497 transitions. Word has length 54 [2022-07-22 11:05:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:27,914 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 497 transitions. [2022-07-22 11:05:27,914 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-22 11:05:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 497 transitions. [2022-07-22 11:05:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-22 11:05:27,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:27,916 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-22 11:05:27,939 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-22 11:05:28,139 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-22 11:05:28,140 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:28,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1697379934, now seen corresponding path program 1 times [2022-07-22 11:05:28,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:28,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512969985] [2022-07-22 11:05:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:28,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:28,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:28,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:28,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 11:05:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:28,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 11:05:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 11:05:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:28,434 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-22 11:05:28,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:28,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512969985] [2022-07-22 11:05:28,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512969985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:28,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:28,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-22 11:05:28,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641801129] [2022-07-22 11:05:28,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:28,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 11:05:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:28,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 11:05:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-22 11:05:28,436 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-22 11:05:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:29,915 INFO L93 Difference]: Finished difference Result 399 states and 828 transitions. [2022-07-22 11:05:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 11:05:29,916 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-22 11:05:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:29,918 INFO L225 Difference]: With dead ends: 399 [2022-07-22 11:05:29,919 INFO L226 Difference]: Without dead ends: 388 [2022-07-22 11:05:29,920 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-22 11:05:29,920 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 370 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2761 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:29,920 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.2s Time] [2022-07-22 11:05:29,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-07-22 11:05:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 268. [2022-07-22 11:05:29,957 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-22 11:05:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 494 transitions. [2022-07-22 11:05:29,966 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 494 transitions. Word has length 55 [2022-07-22 11:05:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:29,966 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 494 transitions. [2022-07-22 11:05:29,967 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-22 11:05:29,967 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 494 transitions. [2022-07-22 11:05:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 11:05:29,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:29,969 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-22 11:05:29,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 11:05:29,970 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:29,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:29,970 INFO L85 PathProgramCache]: Analyzing trace with hash -954910152, now seen corresponding path program 1 times [2022-07-22 11:05:29,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:29,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400047379] [2022-07-22 11:05:29,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:29,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:30,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:30,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:30,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:05:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:30,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:05:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:30,060 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-22 11:05:30,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:30,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400047379] [2022-07-22 11:05:30,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400047379] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:30,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587464436] [2022-07-22 11:05:30,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:30,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:30,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:30,062 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-22 11:05:30,096 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-22 11:05:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:30,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 11:05:30,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:30,227 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-22 11:05:30,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:05:30,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587464436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:30,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 11:05:30,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-07-22 11:05:30,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210669695] [2022-07-22 11:05:30,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:30,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 11:05:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 11:05:30,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-07-22 11:05:30,229 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-22 11:05:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:30,432 INFO L93 Difference]: Finished difference Result 713 states and 1469 transitions. [2022-07-22 11:05:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 11:05:30,435 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-22 11:05:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:30,440 INFO L225 Difference]: With dead ends: 713 [2022-07-22 11:05:30,441 INFO L226 Difference]: Without dead ends: 656 [2022-07-22 11:05:30,442 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-22 11:05:30,442 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-22 11:05:30,443 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-22 11:05:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-07-22 11:05:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 367. [2022-07-22 11:05:30,505 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-22 11:05:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 626 transitions. [2022-07-22 11:05:30,507 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 626 transitions. Word has length 57 [2022-07-22 11:05:30,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:30,508 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 626 transitions. [2022-07-22 11:05:30,508 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-22 11:05:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 626 transitions. [2022-07-22 11:05:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 11:05:30,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:30,510 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-22 11:05:30,535 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-22 11:05:30,732 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-22 11:05:30,732 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:30,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:30,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1347937162, now seen corresponding path program 1 times [2022-07-22 11:05:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:30,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143785376] [2022-07-22 11:05:30,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:30,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:30,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:30,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:05:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:30,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:05:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:30,821 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-22 11:05:30,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:30,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143785376] [2022-07-22 11:05:30,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143785376] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:30,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075619390] [2022-07-22 11:05:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:30,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:30,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:30,824 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-22 11:05:30,825 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-22 11:05:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:30,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 11:05:30,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:30,981 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-22 11:05:30,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:05:30,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075619390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:30,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 11:05:30,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-22 11:05:30,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705207005] [2022-07-22 11:05:30,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:30,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 11:05:30,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:30,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 11:05:30,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-22 11:05:30,983 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-22 11:05:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:31,186 INFO L93 Difference]: Finished difference Result 940 states and 1818 transitions. [2022-07-22 11:05:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 11:05:31,186 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-22 11:05:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:31,191 INFO L225 Difference]: With dead ends: 940 [2022-07-22 11:05:31,191 INFO L226 Difference]: Without dead ends: 759 [2022-07-22 11:05:31,193 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-22 11:05:31,193 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-22 11:05:31,194 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-22 11:05:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-07-22 11:05:31,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 429. [2022-07-22 11:05:31,257 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-22 11:05:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 714 transitions. [2022-07-22 11:05:31,260 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 714 transitions. Word has length 57 [2022-07-22 11:05:31,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:31,260 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 714 transitions. [2022-07-22 11:05:31,260 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-22 11:05:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 714 transitions. [2022-07-22 11:05:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 11:05:31,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:31,262 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-22 11:05:31,289 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-22 11:05:31,483 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-22 11:05:31,484 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:31,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1088923658, now seen corresponding path program 1 times [2022-07-22 11:05:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:31,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59905727] [2022-07-22 11:05:31,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:31,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:31,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:31,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:31,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:05:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:31,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:05:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:31,567 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-22 11:05:31,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:31,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59905727] [2022-07-22 11:05:31,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59905727] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:31,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764324148] [2022-07-22 11:05:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:31,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:31,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:31,569 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-22 11:05:31,612 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-22 11:05:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:31,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 11:05:31,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:31,743 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-22 11:05:31,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:05:31,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764324148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:31,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 11:05:31,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-07-22 11:05:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421921001] [2022-07-22 11:05:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:31,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 11:05:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:31,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 11:05:31,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-07-22 11:05:31,745 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-22 11:05:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:31,870 INFO L93 Difference]: Finished difference Result 567 states and 1019 transitions. [2022-07-22 11:05:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 11:05:31,871 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-22 11:05:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:31,874 INFO L225 Difference]: With dead ends: 567 [2022-07-22 11:05:31,874 INFO L226 Difference]: Without dead ends: 476 [2022-07-22 11:05:31,875 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-22 11:05:31,877 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:31,878 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.1s Time] [2022-07-22 11:05:31,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-07-22 11:05:31,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 353. [2022-07-22 11:05:31,934 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-22 11:05:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 609 transitions. [2022-07-22 11:05:31,936 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 609 transitions. Word has length 57 [2022-07-22 11:05:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:31,936 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 609 transitions. [2022-07-22 11:05:31,936 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-22 11:05:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 609 transitions. [2022-07-22 11:05:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 11:05:31,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:31,939 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-22 11:05:31,965 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-22 11:05:32,155 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-22 11:05:32,155 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:32,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:32,156 INFO L85 PathProgramCache]: Analyzing trace with hash 998579127, now seen corresponding path program 2 times [2022-07-22 11:05:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:32,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426146825] [2022-07-22 11:05:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:32,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:32,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 11:05:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:32,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-22 11:05:32,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:32,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426146825] [2022-07-22 11:05:32,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426146825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:32,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:32,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 11:05:32,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179027535] [2022-07-22 11:05:32,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:32,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 11:05:32,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:32,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 11:05:32,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-22 11:05:32,241 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-22 11:05:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:32,768 INFO L93 Difference]: Finished difference Result 797 states and 1470 transitions. [2022-07-22 11:05:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 11:05:32,769 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-22 11:05:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:32,771 INFO L225 Difference]: With dead ends: 797 [2022-07-22 11:05:32,771 INFO L226 Difference]: Without dead ends: 548 [2022-07-22 11:05:32,774 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-22 11:05:32,776 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-22 11:05:32,776 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-22 11:05:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-22 11:05:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 454. [2022-07-22 11:05:32,835 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-22 11:05:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 714 transitions. [2022-07-22 11:05:32,838 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 714 transitions. Word has length 57 [2022-07-22 11:05:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:32,838 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 714 transitions. [2022-07-22 11:05:32,838 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-22 11:05:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 714 transitions. [2022-07-22 11:05:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 11:05:32,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:32,841 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-22 11:05:32,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 11:05:32,841 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:32,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:32,841 INFO L85 PathProgramCache]: Analyzing trace with hash -12538123, now seen corresponding path program 1 times [2022-07-22 11:05:32,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:32,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312688408] [2022-07-22 11:05:32,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:32,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:32,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:32,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:32,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 11:05:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:32,911 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-22 11:05:32,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:32,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312688408] [2022-07-22 11:05:32,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312688408] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:32,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358442034] [2022-07-22 11:05:32,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:32,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:32,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:32,913 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-22 11:05:32,938 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-22 11:05:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:32,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 11:05:32,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:33,011 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-22 11:05:33,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:33,064 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-22 11:05:33,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358442034] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:33,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:05:33,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11, 10] total 12 [2022-07-22 11:05:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033214726] [2022-07-22 11:05:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:33,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:05:33,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:33,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:05:33,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-22 11:05:33,066 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-22 11:05:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:33,118 INFO L93 Difference]: Finished difference Result 773 states and 1335 transitions. [2022-07-22 11:05:33,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:05:33,119 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-22 11:05:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:33,122 INFO L225 Difference]: With dead ends: 773 [2022-07-22 11:05:33,122 INFO L226 Difference]: Without dead ends: 474 [2022-07-22 11:05:33,131 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-22 11:05:33,132 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-22 11:05:33,133 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-22 11:05:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-22 11:05:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-07-22 11:05:33,187 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-22 11:05:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 732 transitions. [2022-07-22 11:05:33,189 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 732 transitions. Word has length 57 [2022-07-22 11:05:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:33,190 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 732 transitions. [2022-07-22 11:05:33,190 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-22 11:05:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 732 transitions. [2022-07-22 11:05:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 11:05:33,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:33,194 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-22 11:05:33,217 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-22 11:05:33,407 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-22 11:05:33,407 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash -10691081, now seen corresponding path program 1 times [2022-07-22 11:05:33,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:33,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843476136] [2022-07-22 11:05:33,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:33,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:33,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:33,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 11:05:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:33,635 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-22 11:05:33,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:33,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843476136] [2022-07-22 11:05:33,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843476136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:33,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:33,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-22 11:05:33,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803690972] [2022-07-22 11:05:33,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:33,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 11:05:33,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:33,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 11:05:33,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-22 11:05:33,637 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-22 11:05:34,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:34,344 INFO L93 Difference]: Finished difference Result 801 states and 1155 transitions. [2022-07-22 11:05:34,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 11:05:34,345 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-22 11:05:34,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:34,348 INFO L225 Difference]: With dead ends: 801 [2022-07-22 11:05:34,348 INFO L226 Difference]: Without dead ends: 608 [2022-07-22 11:05:34,349 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-22 11:05:34,350 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.5s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:34,350 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.5s Time] [2022-07-22 11:05:34,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-22 11:05:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 568. [2022-07-22 11:05:34,423 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-22 11:05:34,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 834 transitions. [2022-07-22 11:05:34,426 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 834 transitions. Word has length 57 [2022-07-22 11:05:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:34,426 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 834 transitions. [2022-07-22 11:05:34,426 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-22 11:05:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 834 transitions. [2022-07-22 11:05:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-22 11:05:34,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:34,429 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-22 11:05:34,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-22 11:05:34,429 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:34,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1534810419, now seen corresponding path program 1 times [2022-07-22 11:05:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:34,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714534378] [2022-07-22 11:05:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:34,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 11:05:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:34,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 11:05:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:34,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 11:05:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:34,538 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-22 11:05:34,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:34,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714534378] [2022-07-22 11:05:34,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714534378] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:34,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383540274] [2022-07-22 11:05:34,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:34,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:34,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:34,540 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-22 11:05:34,540 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-22 11:05:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:34,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-22 11:05:34,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:34,712 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-22 11:05:34,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:34,896 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-22 11:05:34,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383540274] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:34,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:34,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-07-22 11:05:34,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984637626] [2022-07-22 11:05:34,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:34,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-22 11:05:34,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:34,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-22 11:05:34,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2022-07-22 11:05:34,899 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-22 11:05:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:37,608 INFO L93 Difference]: Finished difference Result 924 states and 1487 transitions. [2022-07-22 11:05:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-22 11:05:37,608 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-22 11:05:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:37,612 INFO L225 Difference]: With dead ends: 924 [2022-07-22 11:05:37,612 INFO L226 Difference]: Without dead ends: 791 [2022-07-22 11:05:37,613 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-22 11:05:37,613 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.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:37,614 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.0s Time] [2022-07-22 11:05:37,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-07-22 11:05:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 564. [2022-07-22 11:05:37,696 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-22 11:05:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 818 transitions. [2022-07-22 11:05:37,699 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 818 transitions. Word has length 59 [2022-07-22 11:05:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:37,699 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 818 transitions. [2022-07-22 11:05:37,699 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-22 11:05:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 818 transitions. [2022-07-22 11:05:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 11:05:37,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:37,702 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-22 11:05:37,728 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-22 11:05:37,917 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-22 11:05:37,918 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:37,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:37,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1198827729, now seen corresponding path program 1 times [2022-07-22 11:05:37,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:37,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190464795] [2022-07-22 11:05:37,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:37,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:37,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:37,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:37,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:05:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:38,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 11:05:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:38,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 11:05:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:38,037 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-22 11:05:38,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:38,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190464795] [2022-07-22 11:05:38,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190464795] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:38,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931444447] [2022-07-22 11:05:38,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:38,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:38,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:38,039 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-22 11:05:38,066 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-22 11:05:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:38,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 11:05:38,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:38,175 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-22 11:05:38,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:38,302 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-22 11:05:38,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931444447] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:38,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:38,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-07-22 11:05:38,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328317361] [2022-07-22 11:05:38,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:38,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 11:05:38,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:38,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 11:05:38,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-22 11:05:38,303 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-22 11:05:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:40,161 INFO L93 Difference]: Finished difference Result 1164 states and 1757 transitions. [2022-07-22 11:05:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 11:05:40,161 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-22 11:05:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:40,165 INFO L225 Difference]: With dead ends: 1164 [2022-07-22 11:05:40,165 INFO L226 Difference]: Without dead ends: 869 [2022-07-22 11:05:40,167 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-22 11:05:40,168 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.4s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:40,168 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.4s Time] [2022-07-22 11:05:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-07-22 11:05:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 644. [2022-07-22 11:05:40,258 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-22 11:05:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 872 transitions. [2022-07-22 11:05:40,261 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 872 transitions. Word has length 60 [2022-07-22 11:05:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:40,261 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 872 transitions. [2022-07-22 11:05:40,261 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-22 11:05:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 872 transitions. [2022-07-22 11:05:40,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-22 11:05:40,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:40,263 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-22 11:05:40,287 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-22 11:05:40,482 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-22 11:05:40,483 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:40,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:40,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1214292501, now seen corresponding path program 1 times [2022-07-22 11:05:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:40,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068917107] [2022-07-22 11:05:40,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:40,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:40,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:40,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 11:05:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:40,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 11:05:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:40,564 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-22 11:05:40,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:40,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068917107] [2022-07-22 11:05:40,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068917107] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:40,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394896271] [2022-07-22 11:05:40,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:40,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:40,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:40,568 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-22 11:05:40,575 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-22 11:05:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:40,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 11:05:40,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:40,730 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-22 11:05:40,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:40,782 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-22 11:05:40,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394896271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:40,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:40,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-07-22 11:05:40,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138340571] [2022-07-22 11:05:40,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:40,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 11:05:40,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:40,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 11:05:40,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-22 11:05:40,784 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-22 11:05:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:41,960 INFO L93 Difference]: Finished difference Result 1351 states and 1983 transitions. [2022-07-22 11:05:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 11:05:41,960 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-22 11:05:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:41,966 INFO L225 Difference]: With dead ends: 1351 [2022-07-22 11:05:41,966 INFO L226 Difference]: Without dead ends: 1128 [2022-07-22 11:05:41,968 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-22 11:05:41,968 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-22 11:05:41,969 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-22 11:05:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2022-07-22 11:05:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 617. [2022-07-22 11:05:42,058 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-22 11:05:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 837 transitions. [2022-07-22 11:05:42,061 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 837 transitions. Word has length 61 [2022-07-22 11:05:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:42,061 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 837 transitions. [2022-07-22 11:05:42,062 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-22 11:05:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 837 transitions. [2022-07-22 11:05:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 11:05:42,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:42,067 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-22 11:05:42,091 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-22 11:05:42,285 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-22 11:05:42,285 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:42,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:42,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1453926245, now seen corresponding path program 1 times [2022-07-22 11:05:42,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:42,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194240741] [2022-07-22 11:05:42,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:42,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:42,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:42,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:42,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:05:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:42,351 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-22 11:05:42,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:42,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194240741] [2022-07-22 11:05:42,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194240741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:42,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763750697] [2022-07-22 11:05:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:42,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:42,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:42,356 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-22 11:05:42,379 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-22 11:05:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:42,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 11:05:42,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:42,452 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-22 11:05:42,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:42,511 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-22 11:05:42,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763750697] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:42,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:42,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-07-22 11:05:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862731980] [2022-07-22 11:05:42,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:42,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 11:05:42,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:42,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 11:05:42,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-22 11:05:42,512 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-22 11:05:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:43,059 INFO L93 Difference]: Finished difference Result 1077 states and 1470 transitions. [2022-07-22 11:05:43,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 11:05:43,059 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-22 11:05:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:43,062 INFO L225 Difference]: With dead ends: 1077 [2022-07-22 11:05:43,062 INFO L226 Difference]: Without dead ends: 779 [2022-07-22 11:05:43,064 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-22 11:05:43,065 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-22 11:05:43,065 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-22 11:05:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-07-22 11:05:43,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 610. [2022-07-22 11:05:43,141 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-22 11:05:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 826 transitions. [2022-07-22 11:05:43,143 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 826 transitions. Word has length 60 [2022-07-22 11:05:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:43,143 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 826 transitions. [2022-07-22 11:05:43,143 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-22 11:05:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 826 transitions. [2022-07-22 11:05:43,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 11:05:43,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:43,145 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-22 11:05:43,167 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-22 11:05:43,367 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-22 11:05:43,368 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:43,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:43,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2131752737, now seen corresponding path program 1 times [2022-07-22 11:05:43,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:43,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906528404] [2022-07-22 11:05:43,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:43,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:43,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:43,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 11:05:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:43,448 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-22 11:05:43,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:43,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906528404] [2022-07-22 11:05:43,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906528404] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:05:43,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945723078] [2022-07-22 11:05:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:43,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:43,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:43,450 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-22 11:05:43,452 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-22 11:05:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:43,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 11:05:43,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:43,611 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-22 11:05:43,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:43,750 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-22 11:05:43,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945723078] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:43,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:05:43,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-07-22 11:05:43,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122282695] [2022-07-22 11:05:43,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:43,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 11:05:43,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:43,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 11:05:43,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-22 11:05:43,752 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-22 11:05:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:44,863 INFO L93 Difference]: Finished difference Result 1342 states and 1932 transitions. [2022-07-22 11:05:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-22 11:05:44,863 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-22 11:05:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:44,872 INFO L225 Difference]: With dead ends: 1342 [2022-07-22 11:05:44,872 INFO L226 Difference]: Without dead ends: 968 [2022-07-22 11:05:44,874 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-22 11:05:44,874 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 449 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:44,874 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-22 11:05:44,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-07-22 11:05:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 698. [2022-07-22 11:05:44,974 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-22 11:05:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 928 transitions. [2022-07-22 11:05:44,976 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 928 transitions. Word has length 60 [2022-07-22 11:05:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:44,976 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 928 transitions. [2022-07-22 11:05:44,976 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-22 11:05:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 928 transitions. [2022-07-22 11:05:44,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 11:05:44,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:44,978 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-22 11:05:45,007 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-22 11:05:45,201 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-22 11:05:45,202 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:45,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1940152897, now seen corresponding path program 1 times [2022-07-22 11:05:45,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:45,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15436796] [2022-07-22 11:05:45,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:45,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:45,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:45,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:45,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 11:05:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:45,284 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-22 11:05:45,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:45,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15436796] [2022-07-22 11:05:45,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15436796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:45,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:45,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 11:05:45,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952705714] [2022-07-22 11:05:45,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:45,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 11:05:45,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:45,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 11:05:45,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-22 11:05:45,287 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-22 11:05:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:46,363 INFO L93 Difference]: Finished difference Result 1624 states and 2442 transitions. [2022-07-22 11:05:46,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 11:05:46,364 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-22 11:05:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:46,369 INFO L225 Difference]: With dead ends: 1624 [2022-07-22 11:05:46,370 INFO L226 Difference]: Without dead ends: 1444 [2022-07-22 11:05:46,371 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-22 11:05:46,372 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-22 11:05:46,372 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-22 11:05:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-07-22 11:05:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 889. [2022-07-22 11:05:46,502 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-22 11:05:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1174 transitions. [2022-07-22 11:05:46,504 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1174 transitions. Word has length 60 [2022-07-22 11:05:46,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:46,505 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1174 transitions. [2022-07-22 11:05:46,505 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-22 11:05:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1174 transitions. [2022-07-22 11:05:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 11:05:46,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:46,507 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-22 11:05:46,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-22 11:05:46,508 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:46,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1676987907, now seen corresponding path program 1 times [2022-07-22 11:05:46,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:46,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398470736] [2022-07-22 11:05:46,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:46,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:46,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:46,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 11:05:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:46,569 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-22 11:05:46,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:46,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398470736] [2022-07-22 11:05:46,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398470736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:46,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:46,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 11:05:46,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907565668] [2022-07-22 11:05:46,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:46,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 11:05:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:46,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 11:05:46,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-22 11:05:46,572 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-22 11:05:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:47,469 INFO L93 Difference]: Finished difference Result 1900 states and 2818 transitions. [2022-07-22 11:05:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 11:05:47,470 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-22 11:05:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:47,476 INFO L225 Difference]: With dead ends: 1900 [2022-07-22 11:05:47,476 INFO L226 Difference]: Without dead ends: 1583 [2022-07-22 11:05:47,478 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-22 11:05:47,479 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.6s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:47,479 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.6s Time] [2022-07-22 11:05:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-07-22 11:05:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 996. [2022-07-22 11:05:47,657 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-22 11:05:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1311 transitions. [2022-07-22 11:05:47,660 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1311 transitions. Word has length 60 [2022-07-22 11:05:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:47,660 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1311 transitions. [2022-07-22 11:05:47,660 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-22 11:05:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1311 transitions. [2022-07-22 11:05:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 11:05:47,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:47,662 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-22 11:05:47,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-22 11:05:47,663 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2074166403, now seen corresponding path program 2 times [2022-07-22 11:05:47,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:47,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462494430] [2022-07-22 11:05:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:47,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 11:05:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:47,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 11:05:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:47,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 11:05:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:47,744 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-22 11:05:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:47,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462494430] [2022-07-22 11:05:47,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462494430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:47,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:47,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 11:05:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736525882] [2022-07-22 11:05:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:47,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 11:05:47,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:47,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 11:05:47,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-22 11:05:47,746 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-22 11:05:48,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:48,270 INFO L93 Difference]: Finished difference Result 1368 states and 1904 transitions. [2022-07-22 11:05:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 11:05:48,271 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-22 11:05:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:48,275 INFO L225 Difference]: With dead ends: 1368 [2022-07-22 11:05:48,275 INFO L226 Difference]: Without dead ends: 1143 [2022-07-22 11:05:48,276 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-22 11:05:48,277 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 180 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:48,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 646 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 11:05:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-07-22 11:05:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 905. [2022-07-22 11:05:48,422 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-22 11:05:48,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1188 transitions. [2022-07-22 11:05:48,424 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1188 transitions. Word has length 60 [2022-07-22 11:05:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:48,424 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1188 transitions. [2022-07-22 11:05:48,425 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-22 11:05:48,425 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1188 transitions. [2022-07-22 11:05:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 11:05:48,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:48,427 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-22 11:05:48,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-22 11:05:48,427 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:48,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1963615586, now seen corresponding path program 1 times [2022-07-22 11:05:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:48,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122582610] [2022-07-22 11:05:48,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:48,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:05:48,454 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:05:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:05:48,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:05:48,494 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 11:05:48,495 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:05:48,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-22 11:05:48,501 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-22 11:05:48,504 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:05:48,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:05:48 BoogieIcfgContainer [2022-07-22 11:05:48,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:05:48,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:05:48,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:05:48,579 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:05:48,579 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:04:49" (3/4) ... [2022-07-22 11:05:48,583 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 11:05:48,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:05:48,583 INFO L158 Benchmark]: Toolchain (without parser) took 59403.74ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 80.5MB in the beginning and 113.1MB in the end (delta: -32.6MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2022-07-22 11:05:48,584 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 115.3MB. Free memory was 88.1MB in the beginning and 88.0MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:05:48,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.70ms. Allocated memory is still 115.3MB. Free memory was 80.3MB in the beginning and 87.6MB in the end (delta: -7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 11:05:48,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.55ms. Allocated memory is still 115.3MB. Free memory was 87.6MB in the beginning and 86.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 11:05:48,587 INFO L158 Benchmark]: Boogie Preprocessor took 35.88ms. Allocated memory is still 115.3MB. Free memory was 85.5MB in the beginning and 84.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 11:05:48,587 INFO L158 Benchmark]: RCFGBuilder took 384.52ms. Allocated memory is still 115.3MB. Free memory was 84.0MB in the beginning and 67.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-22 11:05:48,591 INFO L158 Benchmark]: TraceAbstraction took 58675.05ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 66.7MB in the beginning and 113.1MB in the end (delta: -46.5MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2022-07-22 11:05:48,591 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 201.3MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:05:48,594 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.23ms. Allocated memory is still 115.3MB. Free memory was 88.1MB in the beginning and 88.0MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.70ms. Allocated memory is still 115.3MB. Free memory was 80.3MB in the beginning and 87.6MB in the end (delta: -7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.55ms. Allocated memory is still 115.3MB. Free memory was 87.6MB in the beginning and 86.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.88ms. Allocated memory is still 115.3MB. Free memory was 85.5MB in the beginning and 84.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.52ms. Allocated memory is still 115.3MB. Free memory was 84.0MB in the beginning and 67.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 58675.05ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 66.7MB in the beginning and 113.1MB in the end (delta: -46.5MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 201.3MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=-125, eb=127] [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=0, m=0, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L241] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-125, eb=127, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L29] COND FALSE !(! m) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L57] COND TRUE 1 VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=16777216, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=0, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=8573157381] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, e=-125, m=0, m = m & ~ (1U << 24U)=8573157378, res=4278190080, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L78] __retres4 = res VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, __retres4=4278190080, e=-125, m=0, m = m & ~ (1U << 24U)=8573157378, res=4278190080, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157381, \result=8573157376, __retres4=4278190080, e=-125, m=0, m = m & ~ (1U << 24U)=8573157378, res=4278190080, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L242] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=8573157376, ea=-125, eb=127, m = m & ~ (1U << 24U)=8573157378, ma=16777216, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157378, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, \result=4294967295, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157378, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L243] RET, EXPR base2flt(mb, eb) VAL [a=4278190080, base2flt(mb, eb)=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=8573157378, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=8573157379, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4278190080, b=4294967295, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=8573157379, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=8573157379, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L101] COND FALSE !(! b) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=8573157379, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, m = m & ~ (1U << 24U)=8573157378, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, m = m & ~ (1U << 24U)=8573157378, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L110] ma = ma | (1U << 24U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, m = m & ~ (1U << 24U)=8573157378, ma=4278190084, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=8573157382, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L111] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, m = m & ~ (1U << 24U)=8573157378, ma=4278190084, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, eb=383, m = m & ~ (1U << 24U)=8573157378, ma=4278190084, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L113] mb = mb | (1U << 24U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, eb=383, m = m & ~ (1U << 24U)=8573157378, ma=4278190084, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb=4278190090, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, cond=0, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L17] reach_error() VAL [\old(cond)=0, \old(ma = a & ((1U << 24U) - 1U))=8573157379, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157377, \old(mb = b & ((1U << 24U) - 1U))=8573157382, \old(mb = mb | (1U << 24U))=8573157385, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, cond=0, m = m & ~ (1U << 24U)=8573157378, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157377, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157385, res = m | ((unsigned int )(e + 128) << 24U)=50331648, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.5s, OverallIterations: 32, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 42.5s, 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.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11879 mSDsCounter, 2404 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69559 IncrementalHoareTripleChecker+Invalid, 71963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2404 mSolverCounterUnsat, 5662 mSDtfsCounter, 69559 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2804 GetRequests, 1890 SyntacticMatches, 17 SemanticMatches, 897 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6959 ImplicationChecksByTransitivity, 13.8s 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-22 11:05:48,619 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-?-791161d [2022-07-22 11:05:50,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:05:50,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:05:50,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:05:50,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:05:50,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:05:50,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:05:50,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:05:50,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:05:50,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:05:50,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:05:50,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:05:50,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:05:50,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:05:50,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:05:50,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:05:50,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:05:50,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:05:50,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:05:50,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:05:50,480 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:05:50,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:05:50,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:05:50,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:05:50,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:05:50,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:05:50,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:05:50,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:05:50,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:05:50,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:05:50,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:05:50,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:05:50,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:05:50,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:05:50,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:05:50,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:05:50,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:05:50,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:05:50,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:05:50,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:05:50,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:05:50,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:05:50,510 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 11:05:50,534 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:05:50,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:05:50,535 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:05:50,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:05:50,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:05:50,536 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:05:50,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:05:50,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:05:50,536 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:05:50,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:05:50,537 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:05:50,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:05:50,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:05:50,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:05:50,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:05:50,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:05:50,538 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 11:05:50,538 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 11:05:50,538 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 11:05:50,538 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:05:50,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:05:50,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:05:50,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:05:50,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:05:50,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:05:50,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:05:50,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:05:50,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:05:50,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:05:50,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:05:50,540 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 11:05:50,540 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 11:05:50,540 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:05:50,540 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:05:50,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:05:50,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 11:05:50,541 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-22 11:05:50,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:05:50,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:05:50,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:05:50,822 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:05:50,822 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:05:50,823 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-22 11:05:50,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac06f7275/99fb751eb0cf46dc8113159dbddc6ce3/FLAG1f9992043 [2022-07-22 11:05:51,359 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:05:51,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-22 11:05:51,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac06f7275/99fb751eb0cf46dc8113159dbddc6ce3/FLAG1f9992043 [2022-07-22 11:05:51,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac06f7275/99fb751eb0cf46dc8113159dbddc6ce3 [2022-07-22 11:05:51,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:05:51,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:05:51,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:05:51,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:05:51,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:05:51,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:05:51" (1/1) ... [2022-07-22 11:05:51,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ded0410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51, skipping insertion in model container [2022-07-22 11:05:51,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:05:51" (1/1) ... [2022-07-22 11:05:51,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:05:51,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:05:51,901 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-22 11:05:51,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:05:51,943 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:05:51,953 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-22 11:05:51,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:05:51,984 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:05:51,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51 WrapperNode [2022-07-22 11:05:51,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:05:51,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:05:51,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:05:51,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:05:51,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51" (1/1) ... [2022-07-22 11:05:51,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51" (1/1) ... [2022-07-22 11:05:52,017 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2022-07-22 11:05:52,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:05:52,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:05:52,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:05:52,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:05:52,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51" (1/1) ... [2022-07-22 11:05:52,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51" (1/1) ... [2022-07-22 11:05:52,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51" (1/1) ... [2022-07-22 11:05:52,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51" (1/1) ... [2022-07-22 11:05:52,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51" (1/1) ... [2022-07-22 11:05:52,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51" (1/1) ... [2022-07-22 11:05:52,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51" (1/1) ... [2022-07-22 11:05:52,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:05:52,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:05:52,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:05:52,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:05:52,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51" (1/1) ... [2022-07-22 11:05:52,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:05:52,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:52,096 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-22 11:05:52,123 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-22 11:05:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:05:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 11:05:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-22 11:05:52,140 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-22 11:05:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:05:52,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:05:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-22 11:05:52,141 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-22 11:05:52,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 11:05:52,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 11:05:52,195 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:05:52,196 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:05:52,415 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:05:52,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:05:52,420 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 11:05:52,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:05:52 BoogieIcfgContainer [2022-07-22 11:05:52,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:05:52,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:05:52,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:05:52,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:05:52,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:05:51" (1/3) ... [2022-07-22 11:05:52,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fefa23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:05:52, skipping insertion in model container [2022-07-22 11:05:52,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:05:51" (2/3) ... [2022-07-22 11:05:52,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fefa23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:05:52, skipping insertion in model container [2022-07-22 11:05:52,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:05:52" (3/3) ... [2022-07-22 11:05:52,458 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-07-22 11:05:52,468 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:05:52,469 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:05:52,529 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:05:52,535 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@7c9555f9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23e92b8b [2022-07-22 11:05:52,535 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:05:52,552 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-22 11:05:52,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 11:05:52,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:52,560 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-22 11:05:52,560 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:52,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:52,566 INFO L85 PathProgramCache]: Analyzing trace with hash 173410466, now seen corresponding path program 1 times [2022-07-22 11:05:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:05:52,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49980124] [2022-07-22 11:05:52,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:52,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:05:52,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:05:52,587 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-22 11:05:52,630 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-22 11:05:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:52,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 11:05:52,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:52,847 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-22 11:05:52,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:05:52,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:05:52,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49980124] [2022-07-22 11:05:52,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49980124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:52,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:52,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 11:05:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262620389] [2022-07-22 11:05:52,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:52,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 11:05:52,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:05:52,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 11:05:52,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:05:52,897 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-22 11:05:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:53,037 INFO L93 Difference]: Finished difference Result 130 states and 196 transitions. [2022-07-22 11:05:53,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 11:05:53,042 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-22 11:05:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:53,051 INFO L225 Difference]: With dead ends: 130 [2022-07-22 11:05:53,051 INFO L226 Difference]: Without dead ends: 71 [2022-07-22 11:05:53,055 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-22 11:05:53,059 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:53,062 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-22 11:05:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-22 11:05:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2022-07-22 11:05:53,097 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-22 11:05:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-07-22 11:05:53,100 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 31 [2022-07-22 11:05:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:53,100 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-07-22 11:05:53,101 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-22 11:05:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-07-22 11:05:53,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 11:05:53,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:53,103 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-22 11:05:53,111 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-22 11:05:53,311 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-22 11:05:53,312 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:53,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:53,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1707598935, now seen corresponding path program 1 times [2022-07-22 11:05:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:05:53,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731335773] [2022-07-22 11:05:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:53,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:05:53,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:05:53,315 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-22 11:05:53,318 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-22 11:05:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:53,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 11:05:53,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:53,428 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-22 11:05:53,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:53,501 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-22 11:05:53,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:05:53,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731335773] [2022-07-22 11:05:53,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731335773] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:53,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:05:53,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-07-22 11:05:53,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384088472] [2022-07-22 11:05:53,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:53,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 11:05:53,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:05:53,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 11:05:53,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 11:05:53,512 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-22 11:05:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:53,635 INFO L93 Difference]: Finished difference Result 121 states and 161 transitions. [2022-07-22 11:05:53,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 11:05:53,636 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-22 11:05:53,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:53,638 INFO L225 Difference]: With dead ends: 121 [2022-07-22 11:05:53,638 INFO L226 Difference]: Without dead ends: 93 [2022-07-22 11:05:53,639 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-22 11:05:53,640 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-22 11:05:53,640 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-22 11:05:53,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-22 11:05:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2022-07-22 11:05:53,650 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-22 11:05:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2022-07-22 11:05:53,652 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 35 [2022-07-22 11:05:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:53,652 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2022-07-22 11:05:53,652 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-22 11:05:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2022-07-22 11:05:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 11:05:53,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:53,654 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-22 11:05:53,665 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-22 11:05:53,863 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-22 11:05:53,863 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:53,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:53,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1508244029, now seen corresponding path program 1 times [2022-07-22 11:05:53,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:05:53,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150324265] [2022-07-22 11:05:53,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:53,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:05:53,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:05:53,867 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-22 11:05:53,868 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-22 11:05:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:53,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 11:05:53,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:54,003 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-22 11:05:54,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:54,060 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-22 11:05:54,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:05:54,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150324265] [2022-07-22 11:05:54,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150324265] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:54,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:05:54,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-22 11:05:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404716354] [2022-07-22 11:05:54,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:54,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 11:05:54,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:05:54,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 11:05:54,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:05:54,069 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-22 11:05:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:54,164 INFO L93 Difference]: Finished difference Result 113 states and 150 transitions. [2022-07-22 11:05:54,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 11:05:54,166 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-22 11:05:54,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:54,167 INFO L225 Difference]: With dead ends: 113 [2022-07-22 11:05:54,167 INFO L226 Difference]: Without dead ends: 89 [2022-07-22 11:05:54,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-22 11:05:54,169 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-22 11:05:54,169 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-22 11:05:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-22 11:05:54,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2022-07-22 11:05:54,177 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-22 11:05:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2022-07-22 11:05:54,179 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 39 [2022-07-22 11:05:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:54,179 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2022-07-22 11:05:54,179 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-22 11:05:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-07-22 11:05:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 11:05:54,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:54,181 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-22 11:05:54,196 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-22 11:05:54,389 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-22 11:05:54,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash -54729342, now seen corresponding path program 2 times [2022-07-22 11:05:54,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:05:54,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670474959] [2022-07-22 11:05:54,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 11:05:54,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:05:54,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:05:54,393 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-22 11:05:54,395 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-22 11:05:54,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 11:05:54,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:05:54,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 11:05:54,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:54,563 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-22 11:05:54,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:05:54,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:05:54,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670474959] [2022-07-22 11:05:54,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670474959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:54,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:54,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 11:05:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571652320] [2022-07-22 11:05:54,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:54,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:05:54,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:05:54,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:05:54,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:05:54,566 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-22 11:05:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:54,633 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2022-07-22 11:05:54,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:05:54,634 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-22 11:05:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:54,638 INFO L225 Difference]: With dead ends: 96 [2022-07-22 11:05:54,638 INFO L226 Difference]: Without dead ends: 94 [2022-07-22 11:05:54,641 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-22 11:05:54,646 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-22 11:05:54,647 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-22 11:05:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-22 11:05:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2022-07-22 11:05:54,659 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-22 11:05:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2022-07-22 11:05:54,661 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 39 [2022-07-22 11:05:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:54,663 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2022-07-22 11:05:54,664 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-22 11:05:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-07-22 11:05:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 11:05:54,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:54,671 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-22 11:05:54,685 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-22 11:05:54,879 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-22 11:05:54,880 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2528960, now seen corresponding path program 1 times [2022-07-22 11:05:54,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:05:54,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429377328] [2022-07-22 11:05:54,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:54,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:05:54,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:05:54,884 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-22 11:05:54,885 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-22 11:05:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:54,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 11:05:54,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:55,027 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-22 11:05:55,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:05:55,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:05:55,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429377328] [2022-07-22 11:05:55,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429377328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:55,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:55,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 11:05:55,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306885691] [2022-07-22 11:05:55,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:55,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:05:55,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:05:55,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:05:55,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:05:55,031 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-22 11:05:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:55,092 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-07-22 11:05:55,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:05:55,095 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-22 11:05:55,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:55,096 INFO L225 Difference]: With dead ends: 96 [2022-07-22 11:05:55,096 INFO L226 Difference]: Without dead ends: 94 [2022-07-22 11:05:55,096 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-22 11:05:55,097 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-22 11:05:55,097 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-22 11:05:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-22 11:05:55,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-07-22 11:05:55,115 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-22 11:05:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2022-07-22 11:05:55,117 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 39 [2022-07-22 11:05:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:55,118 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2022-07-22 11:05:55,118 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-22 11:05:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2022-07-22 11:05:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 11:05:55,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:55,119 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-22 11:05:55,129 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-22 11:05:55,328 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-22 11:05:55,328 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:55,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1837968146, now seen corresponding path program 1 times [2022-07-22 11:05:55,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:05:55,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499295430] [2022-07-22 11:05:55,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:55,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:05:55,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:05:55,331 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-22 11:05:55,332 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-22 11:05:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:55,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 11:05:55,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:55,471 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-22 11:05:55,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:05:55,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:05:55,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499295430] [2022-07-22 11:05:55,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499295430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:55,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:55,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 11:05:55,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483318027] [2022-07-22 11:05:55,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:55,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 11:05:55,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:05:55,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 11:05:55,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-22 11:05:55,473 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-22 11:05:55,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:55,676 INFO L93 Difference]: Finished difference Result 126 states and 165 transitions. [2022-07-22 11:05:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 11:05:55,677 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-22 11:05:55,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:55,678 INFO L225 Difference]: With dead ends: 126 [2022-07-22 11:05:55,678 INFO L226 Difference]: Without dead ends: 119 [2022-07-22 11:05:55,679 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-22 11:05:55,679 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 33 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:55,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 661 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:05:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-22 11:05:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-07-22 11:05:55,689 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-22 11:05:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-07-22 11:05:55,690 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 44 [2022-07-22 11:05:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:55,690 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-07-22 11:05:55,690 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-22 11:05:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-07-22 11:05:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-22 11:05:55,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:55,692 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-22 11:05:55,700 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-22 11:05:55,900 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-22 11:05:55,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:55,902 INFO L85 PathProgramCache]: Analyzing trace with hash 595859751, now seen corresponding path program 1 times [2022-07-22 11:05:55,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:05:55,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270441824] [2022-07-22 11:05:55,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:55,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:05:55,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:05:55,904 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-22 11:05:55,905 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-22 11:05:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:05:55,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 11:05:55,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:05:56,021 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-22 11:05:56,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:05:56,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 11:05:56,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270441824] [2022-07-22 11:05:56,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270441824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:05:56,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:05:56,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 11:05:56,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95211720] [2022-07-22 11:05:56,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:05:56,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 11:05:56,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 11:05:56,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 11:05:56,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 11:05:56,026 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-22 11:05:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:56,130 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2022-07-22 11:05:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 11:05:56,131 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-22 11:05:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:56,132 INFO L225 Difference]: With dead ends: 164 [2022-07-22 11:05:56,132 INFO L226 Difference]: Without dead ends: 127 [2022-07-22 11:05:56,133 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-22 11:05:56,133 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-22 11:05:56,133 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-22 11:05:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-22 11:05:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2022-07-22 11:05:56,150 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-22 11:05:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2022-07-22 11:05:56,152 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 49 [2022-07-22 11:05:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:56,152 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2022-07-22 11:05:56,152 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-22 11:05:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2022-07-22 11:05:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 11:05:56,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:56,153 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-22 11:05:56,164 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-22 11:05:56,364 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-22 11:05:56,365 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:56,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1849173563, now seen corresponding path program 1 times [2022-07-22 11:05:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 11:05:56,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421275616] [2022-07-22 11:05:56,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:56,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 11:05:56,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 11:05:56,366 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-22 11:05:56,367 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-22 11:05:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:05:56,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:05:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:05:56,480 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-22 11:05:56,481 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 11:05:56,481 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:05:56,499 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-22 11:05:56,684 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-22 11:05:56,687 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-07-22 11:05:56,690 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:05:56,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:05:56 BoogieIcfgContainer [2022-07-22 11:05:56,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:05:56,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:05:56,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:05:56,718 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:05:56,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:05:52" (3/4) ... [2022-07-22 11:05:56,719 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 11:05:56,765 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 11:05:56,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:05:56,765 INFO L158 Benchmark]: Toolchain (without parser) took 5021.31ms. Allocated memory was 50.3MB in the beginning and 73.4MB in the end (delta: 23.1MB). Free memory was 25.8MB in the beginning and 53.1MB in the end (delta: -27.3MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2022-07-22 11:05:56,766 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 32.0MB in the beginning and 32.0MB in the end (delta: 31.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:05:56,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.50ms. Allocated memory is still 50.3MB. Free memory was 25.7MB in the beginning and 24.2MB in the end (delta: 1.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-22 11:05:56,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.99ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 24.2MB in the beginning and 44.8MB in the end (delta: -20.5MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2022-07-22 11:05:56,767 INFO L158 Benchmark]: Boogie Preprocessor took 40.37ms. Allocated memory is still 60.8MB. Free memory was 44.8MB in the beginning and 43.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:05:56,767 INFO L158 Benchmark]: RCFGBuilder took 376.82ms. Allocated memory is still 60.8MB. Free memory was 43.4MB in the beginning and 31.2MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 11:05:56,767 INFO L158 Benchmark]: TraceAbstraction took 4279.52ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 30.6MB in the beginning and 50.2MB in the end (delta: -19.6MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-07-22 11:05:56,767 INFO L158 Benchmark]: Witness Printer took 47.64ms. Allocated memory is still 73.4MB. Free memory was 50.2MB in the beginning and 53.1MB in the end (delta: -2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 11:05:56,769 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 32.0MB in the beginning and 32.0MB in the end (delta: 31.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.50ms. Allocated memory is still 50.3MB. Free memory was 25.7MB in the beginning and 24.2MB in the end (delta: 1.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.99ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 24.2MB in the beginning and 44.8MB in the end (delta: -20.5MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.37ms. Allocated memory is still 60.8MB. Free memory was 44.8MB in the beginning and 43.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 376.82ms. Allocated memory is still 60.8MB. Free memory was 43.4MB in the beginning and 31.2MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4279.52ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 30.6MB in the beginning and 50.2MB in the end (delta: -19.6MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Witness Printer took 47.64ms. Allocated memory is still 73.4MB. Free memory was 50.2MB in the beginning and 53.1MB in the end (delta: -2.9MB). 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.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 3230 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 26 IncrementalHoareTripleChecker+Unchecked, 2747 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 520 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 483 mSDtfsCounter, 520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.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.8s 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-22 11:05:56,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE