./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 6c24879c 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-?-6c24879 [2022-07-11 23:41:01,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:41:01,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:41:01,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:41:01,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:41:01,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:41:01,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:41:01,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:41:01,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:41:01,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:41:01,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:41:01,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:41:01,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:41:01,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:41:01,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:41:01,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:41:01,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:41:01,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:41:01,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:41:01,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:41:01,476 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:41:01,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:41:01,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:41:01,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:41:01,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:41:01,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:41:01,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:41:01,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:41:01,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:41:01,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:41:01,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:41:01,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:41:01,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:41:01,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:41:01,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:41:01,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:41:01,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:41:01,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:41:01,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:41:01,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:41:01,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:41:01,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:41:01,498 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:41:01,527 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:41:01,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:41:01,528 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:41:01,528 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:41:01,529 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:41:01,529 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:41:01,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:41:01,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:41:01,530 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:41:01,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:41:01,531 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:41:01,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:41:01,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:41:01,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:41:01,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:41:01,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:41:01,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:41:01,533 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:41:01,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:41:01,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:41:01,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:41:01,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:41:01,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:41:01,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:41:01,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:41:01,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:41:01,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:41:01,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:41:01,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:41:01,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:41:01,536 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:41:01,536 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:41:01,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:41:01,536 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-11 23:41:01,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:41:01,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:41:01,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:41:01,795 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:41:01,796 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:41:01,798 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-11 23:41:01,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f167396f3/5d9ffec36ec84b4583257815ba3e370a/FLAG24948c9b9 [2022-07-11 23:41:02,251 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:41:02,251 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-11 23:41:02,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f167396f3/5d9ffec36ec84b4583257815ba3e370a/FLAG24948c9b9 [2022-07-11 23:41:02,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f167396f3/5d9ffec36ec84b4583257815ba3e370a [2022-07-11 23:41:02,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:41:02,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:41:02,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:41:02,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:41:02,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:41:02,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:41:02" (1/1) ... [2022-07-11 23:41:02,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e4aca09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02, skipping insertion in model container [2022-07-11 23:41:02,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:41:02" (1/1) ... [2022-07-11 23:41:02,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:41:02,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:41:02,812 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-11 23:41:02,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:41:02,883 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:41:02,892 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-11 23:41:02,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:41:02,937 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:41:02,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02 WrapperNode [2022-07-11 23:41:02,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:41:02,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:41:02,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:41:02,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:41:02,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02" (1/1) ... [2022-07-11 23:41:02,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02" (1/1) ... [2022-07-11 23:41:02,971 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-07-11 23:41:02,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:41:02,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:41:02,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:41:02,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:41:02,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02" (1/1) ... [2022-07-11 23:41:02,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02" (1/1) ... [2022-07-11 23:41:02,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02" (1/1) ... [2022-07-11 23:41:02,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02" (1/1) ... [2022-07-11 23:41:02,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02" (1/1) ... [2022-07-11 23:41:02,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02" (1/1) ... [2022-07-11 23:41:02,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02" (1/1) ... [2022-07-11 23:41:02,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:41:02,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:41:02,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:41:02,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:41:02,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02" (1/1) ... [2022-07-11 23:41:03,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:41:03,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:03,026 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-11 23:41:03,050 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-11 23:41:03,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:41:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:41:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-11 23:41:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-11 23:41:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:41:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:41:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-11 23:41:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-11 23:41:03,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-11 23:41:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-11 23:41:03,127 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:41:03,128 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:41:03,407 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:41:03,416 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:41:03,416 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-11 23:41:03,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:41:03 BoogieIcfgContainer [2022-07-11 23:41:03,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:41:03,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:41:03,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:41:03,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:41:03,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:41:02" (1/3) ... [2022-07-11 23:41:03,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b5d264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:41:03, skipping insertion in model container [2022-07-11 23:41:03,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:02" (2/3) ... [2022-07-11 23:41:03,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b5d264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:41:03, skipping insertion in model container [2022-07-11 23:41:03,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:41:03" (3/3) ... [2022-07-11 23:41:03,431 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-07-11 23:41:03,451 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:41:03,451 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:41:03,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:41:03,498 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@411fb725, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48bf1096 [2022-07-11 23:41:03,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:41:03,502 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-11 23:41:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:41:03,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:03,511 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-11 23:41:03,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:03,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash 176765495, now seen corresponding path program 1 times [2022-07-11 23:41:03,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:03,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115521435] [2022-07-11 23:41:03,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,784 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-11 23:41:03,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:03,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115521435] [2022-07-11 23:41:03,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115521435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:03,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:03,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:41:03,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537544803] [2022-07-11 23:41:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:03,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:41:03,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:41:03,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:41:03,831 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-11 23:41:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:03,924 INFO L93 Difference]: Finished difference Result 181 states and 305 transitions. [2022-07-11 23:41:03,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:41:03,927 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-11 23:41:03,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:03,936 INFO L225 Difference]: With dead ends: 181 [2022-07-11 23:41:03,936 INFO L226 Difference]: Without dead ends: 92 [2022-07-11 23:41:03,939 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-11 23:41:03,942 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.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:03,943 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.1s Time] [2022-07-11 23:41:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-11 23:41:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2022-07-11 23:41:03,978 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-11 23:41:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2022-07-11 23:41:03,982 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 37 [2022-07-11 23:41:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:03,983 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2022-07-11 23:41:03,983 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-11 23:41:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2022-07-11 23:41:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:41:03,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:03,986 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-11 23:41:03,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:41:03,986 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:03,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:03,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1174822094, now seen corresponding path program 1 times [2022-07-11 23:41:03,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:03,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201662077] [2022-07-11 23:41:03,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:04,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:04,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:04,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:04,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-11 23:41:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:04,390 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-11 23:41:04,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:04,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201662077] [2022-07-11 23:41:04,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201662077] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:04,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667560749] [2022-07-11 23:41:04,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:04,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:04,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:04,399 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-11 23:41:04,419 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-11 23:41:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:04,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-11 23:41:04,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:04,720 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-11 23:41:04,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:04,939 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-11 23:41:04,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667560749] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:04,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:04,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 24 [2022-07-11 23:41:04,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661733751] [2022-07-11 23:41:04,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:04,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-11 23:41:04,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:04,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-11 23:41:04,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2022-07-11 23:41:04,944 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-11 23:41:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:07,727 INFO L93 Difference]: Finished difference Result 419 states and 669 transitions. [2022-07-11 23:41:07,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-11 23:41:07,728 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-11 23:41:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:07,733 INFO L225 Difference]: With dead ends: 419 [2022-07-11 23:41:07,733 INFO L226 Difference]: Without dead ends: 338 [2022-07-11 23:41:07,736 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-11 23:41:07,737 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-11 23:41:07,738 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-11 23:41:07,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-11 23:41:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 116. [2022-07-11 23:41:07,775 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-11 23:41:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2022-07-11 23:41:07,777 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 44 [2022-07-11 23:41:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:07,778 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2022-07-11 23:41:07,778 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-11 23:41:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2022-07-11 23:41:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:41:07,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:07,781 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-11 23:41:07,806 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-11 23:41:08,003 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-11 23:41:08,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:08,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:08,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1191712414, now seen corresponding path program 1 times [2022-07-11 23:41:08,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:08,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112357262] [2022-07-11 23:41:08,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:08,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:08,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:08,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:08,088 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-11 23:41:08,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:08,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112357262] [2022-07-11 23:41:08,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112357262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:08,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:08,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:41:08,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576000298] [2022-07-11 23:41:08,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:08,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:41:08,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:08,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:41:08,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:41:08,090 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-11 23:41:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:08,191 INFO L93 Difference]: Finished difference Result 212 states and 306 transitions. [2022-07-11 23:41:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:41:08,192 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-11 23:41:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:08,197 INFO L225 Difference]: With dead ends: 212 [2022-07-11 23:41:08,197 INFO L226 Difference]: Without dead ends: 132 [2022-07-11 23:41:08,198 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-11 23:41:08,201 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-11 23:41:08,203 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-11 23:41:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-11 23:41:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 117. [2022-07-11 23:41:08,239 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-11 23:41:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2022-07-11 23:41:08,242 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 43 [2022-07-11 23:41:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:08,243 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2022-07-11 23:41:08,243 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-11 23:41:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2022-07-11 23:41:08,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:41:08,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:08,250 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-11 23:41:08,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:41:08,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:08,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash 186942930, now seen corresponding path program 1 times [2022-07-11 23:41:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:08,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869484252] [2022-07-11 23:41:08,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:08,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:08,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:08,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:08,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:08,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-11 23:41:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:08,557 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-11 23:41:08,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:08,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869484252] [2022-07-11 23:41:08,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869484252] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:08,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:08,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-11 23:41:08,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509487167] [2022-07-11 23:41:08,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:08,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:41:08,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:08,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:41:08,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:41:08,560 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-11 23:41:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:10,073 INFO L93 Difference]: Finished difference Result 250 states and 362 transitions. [2022-07-11 23:41:10,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-11 23:41:10,074 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-11 23:41:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:10,076 INFO L225 Difference]: With dead ends: 250 [2022-07-11 23:41:10,076 INFO L226 Difference]: Without dead ends: 242 [2022-07-11 23:41:10,077 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-11 23:41:10,078 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 288 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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-11 23:41:10,079 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-11 23:41:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-11 23:41:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 122. [2022-07-11 23:41:10,092 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-11 23:41:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 173 transitions. [2022-07-11 23:41:10,093 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 173 transitions. Word has length 44 [2022-07-11 23:41:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:10,094 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 173 transitions. [2022-07-11 23:41:10,094 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-11 23:41:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 173 transitions. [2022-07-11 23:41:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:41:10,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:10,096 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-11 23:41:10,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:41:10,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:10,097 INFO L85 PathProgramCache]: Analyzing trace with hash -407484938, now seen corresponding path program 1 times [2022-07-11 23:41:10,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:10,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94617854] [2022-07-11 23:41:10,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:10,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-11 23:41:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,162 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-11 23:41:10,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:10,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94617854] [2022-07-11 23:41:10,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94617854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:10,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:10,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:41:10,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164361815] [2022-07-11 23:41:10,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:10,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:41:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:10,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:41:10,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:41:10,165 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-11 23:41:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:10,580 INFO L93 Difference]: Finished difference Result 179 states and 253 transitions. [2022-07-11 23:41:10,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:41:10,587 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-11 23:41:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:10,591 INFO L225 Difference]: With dead ends: 179 [2022-07-11 23:41:10,591 INFO L226 Difference]: Without dead ends: 168 [2022-07-11 23:41:10,593 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-11 23:41:10,594 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 201 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:10,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 239 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:41:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-11 23:41:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2022-07-11 23:41:10,613 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-11 23:41:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2022-07-11 23:41:10,615 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 46 [2022-07-11 23:41:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:10,616 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2022-07-11 23:41:10,616 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-11 23:41:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2022-07-11 23:41:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:41:10,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:10,621 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-11 23:41:10,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:41:10,622 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:10,623 INFO L85 PathProgramCache]: Analyzing trace with hash -167909170, now seen corresponding path program 1 times [2022-07-11 23:41:10,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:10,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427625139] [2022-07-11 23:41:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:10,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,739 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-11 23:41:10,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:10,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427625139] [2022-07-11 23:41:10,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427625139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:10,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:10,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-11 23:41:10,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015042069] [2022-07-11 23:41:10,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:10,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:41:10,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:10,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:41:10,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:41:10,742 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-11 23:41:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:11,084 INFO L93 Difference]: Finished difference Result 222 states and 313 transitions. [2022-07-11 23:41:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:41:11,085 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-11 23:41:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:11,086 INFO L225 Difference]: With dead ends: 222 [2022-07-11 23:41:11,086 INFO L226 Difference]: Without dead ends: 166 [2022-07-11 23:41:11,087 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-11 23:41:11,087 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-11 23:41:11,088 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-11 23:41:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-11 23:41:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2022-07-11 23:41:11,101 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-11 23:41:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2022-07-11 23:41:11,103 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 46 [2022-07-11 23:41:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:11,104 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2022-07-11 23:41:11,104 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-11 23:41:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2022-07-11 23:41:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:41:11,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:11,106 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-11 23:41:11,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:41:11,107 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1626225281, now seen corresponding path program 1 times [2022-07-11 23:41:11,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:11,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278081484] [2022-07-11 23:41:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:11,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:11,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:11,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:11,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:11,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:41:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:11,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-11 23:41:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:11,365 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-11 23:41:11,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278081484] [2022-07-11 23:41:11,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278081484] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933567957] [2022-07-11 23:41:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:11,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:11,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:11,372 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-11 23:41:11,400 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-11 23:41:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:11,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-11 23:41:11,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:11,661 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-11 23:41:11,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:12,048 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-11 23:41:12,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933567957] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:12,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:12,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 34 [2022-07-11 23:41:12,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113767535] [2022-07-11 23:41:12,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:12,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-11 23:41:12,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:12,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-11 23:41:12,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2022-07-11 23:41:12,050 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-11 23:41:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:17,666 INFO L93 Difference]: Finished difference Result 483 states and 769 transitions. [2022-07-11 23:41:17,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-11 23:41:17,671 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-11 23:41:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:17,676 INFO L225 Difference]: With dead ends: 483 [2022-07-11 23:41:17,676 INFO L226 Difference]: Without dead ends: 472 [2022-07-11 23:41:17,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=739, Invalid=6233, Unknown=0, NotChecked=0, Total=6972 [2022-07-11 23:41:17,680 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 797 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 8894 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 9161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 8894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:17,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 739 Invalid, 9161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 8894 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-11 23:41:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-11 23:41:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 164. [2022-07-11 23:41:17,703 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-11 23:41:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2022-07-11 23:41:17,704 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 48 [2022-07-11 23:41:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:17,705 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2022-07-11 23:41:17,705 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-11 23:41:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2022-07-11 23:41:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:41:17,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:17,707 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-11 23:41:17,734 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-11 23:41:17,919 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-11 23:41:17,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:17,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash 976965441, now seen corresponding path program 2 times [2022-07-11 23:41:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:17,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826197791] [2022-07-11 23:41:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:17,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:17,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:18,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:41:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:18,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:41:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:18,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-11 23:41:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:18,133 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-11 23:41:18,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:18,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826197791] [2022-07-11 23:41:18,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826197791] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:18,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289944096] [2022-07-11 23:41:18,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:41:18,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:18,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:18,140 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-11 23:41:18,166 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-11 23:41:18,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:41:18,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:41:18,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-11 23:41:18,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:18,353 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-11 23:41:18,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:18,627 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-11 23:41:18,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289944096] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:18,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:18,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-07-11 23:41:18,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18770410] [2022-07-11 23:41:18,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:18,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-11 23:41:18,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:18,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-11 23:41:18,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2022-07-11 23:41:18,630 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-11 23:41:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:21,514 INFO L93 Difference]: Finished difference Result 348 states and 670 transitions. [2022-07-11 23:41:21,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-11 23:41:21,514 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-11 23:41:21,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:21,517 INFO L225 Difference]: With dead ends: 348 [2022-07-11 23:41:21,518 INFO L226 Difference]: Without dead ends: 341 [2022-07-11 23:41:21,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=378, Invalid=3282, Unknown=0, NotChecked=0, Total=3660 [2022-07-11 23:41:21,520 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 809 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 4614 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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-11 23:41:21,520 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-11 23:41:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-11 23:41:21,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 172. [2022-07-11 23:41:21,544 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-11 23:41:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 272 transitions. [2022-07-11 23:41:21,546 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 272 transitions. Word has length 48 [2022-07-11 23:41:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:21,546 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 272 transitions. [2022-07-11 23:41:21,546 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-11 23:41:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 272 transitions. [2022-07-11 23:41:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 23:41:21,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:21,548 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-11 23:41:21,578 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-11 23:41:21,763 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-11 23:41:21,764 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:21,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1260029991, now seen corresponding path program 1 times [2022-07-11 23:41:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:21,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893554682] [2022-07-11 23:41:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:21,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:21,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:21,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:21,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:21,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:41:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:21,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-11 23:41:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:21,900 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-11 23:41:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:21,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893554682] [2022-07-11 23:41:21,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893554682] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:21,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887928958] [2022-07-11 23:41:21,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:21,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:21,902 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-11 23:41:21,903 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-11 23:41:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:21,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-11 23:41:21,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:22,048 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-11 23:41:22,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:22,295 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-11 23:41:22,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887928958] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:22,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:22,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 24 [2022-07-11 23:41:22,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227217506] [2022-07-11 23:41:22,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:22,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-11 23:41:22,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:22,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-11 23:41:22,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-11 23:41:22,297 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-11 23:41:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:24,188 INFO L93 Difference]: Finished difference Result 342 states and 591 transitions. [2022-07-11 23:41:24,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-11 23:41:24,189 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-11 23:41:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:24,191 INFO L225 Difference]: With dead ends: 342 [2022-07-11 23:41:24,191 INFO L226 Difference]: Without dead ends: 331 [2022-07-11 23:41:24,192 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-11 23:41:24,193 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 425 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 3749 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 3825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 3749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:24,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 463 Invalid, 3825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 3749 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-11 23:41:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-11 23:41:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 172. [2022-07-11 23:41:24,217 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-11 23:41:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 272 transitions. [2022-07-11 23:41:24,219 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 272 transitions. Word has length 50 [2022-07-11 23:41:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:24,219 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 272 transitions. [2022-07-11 23:41:24,220 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-11 23:41:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 272 transitions. [2022-07-11 23:41:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 23:41:24,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:24,221 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-11 23:41:24,247 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-11 23:41:24,439 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-11 23:41:24,439 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:24,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1462321561, now seen corresponding path program 1 times [2022-07-11 23:41:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:24,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105992443] [2022-07-11 23:41:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:24,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:24,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:41:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:24,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:41:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:24,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-11 23:41:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:24,636 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-11 23:41:24,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:24,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105992443] [2022-07-11 23:41:24,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105992443] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:24,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933457200] [2022-07-11 23:41:24,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:24,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:24,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:24,638 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-11 23:41:24,640 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-11 23:41:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:24,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-11 23:41:24,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:24,840 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-11 23:41:24,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:25,158 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-11 23:41:25,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933457200] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:25,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:25,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 31 [2022-07-11 23:41:25,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570882064] [2022-07-11 23:41:25,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:25,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-11 23:41:25,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:25,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-11 23:41:25,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=861, Unknown=0, NotChecked=0, Total=930 [2022-07-11 23:41:25,160 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-11 23:41:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:28,179 INFO L93 Difference]: Finished difference Result 343 states and 636 transitions. [2022-07-11 23:41:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-11 23:41:28,180 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-11 23:41:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:28,182 INFO L225 Difference]: With dead ends: 343 [2022-07-11 23:41:28,182 INFO L226 Difference]: Without dead ends: 320 [2022-07-11 23:41:28,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=449, Invalid=4107, Unknown=0, NotChecked=0, Total=4556 [2022-07-11 23:41:28,184 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 792 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 4569 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 4569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:28,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 499 Invalid, 4726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 4569 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-11 23:41:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-11 23:41:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 180. [2022-07-11 23:41:28,204 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-11 23:41:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 289 transitions. [2022-07-11 23:41:28,206 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 289 transitions. Word has length 50 [2022-07-11 23:41:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:28,206 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 289 transitions. [2022-07-11 23:41:28,207 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-11 23:41:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 289 transitions. [2022-07-11 23:41:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 23:41:28,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:28,208 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-11 23:41:28,229 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-11 23:41:28,423 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-11 23:41:28,424 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:28,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1556864061, now seen corresponding path program 1 times [2022-07-11 23:41:28,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:28,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894962563] [2022-07-11 23:41:28,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:28,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,475 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-11 23:41:28,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:28,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894962563] [2022-07-11 23:41:28,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894962563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:28,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:28,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:41:28,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795454312] [2022-07-11 23:41:28,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:28,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:41:28,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:28,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:41:28,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:41:28,480 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-11 23:41:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:28,561 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2022-07-11 23:41:28,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:41:28,562 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-11 23:41:28,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:28,563 INFO L225 Difference]: With dead ends: 304 [2022-07-11 23:41:28,564 INFO L226 Difference]: Without dead ends: 188 [2022-07-11 23:41:28,565 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-11 23:41:28,566 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:28,566 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-11 23:41:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-11 23:41:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2022-07-11 23:41:28,582 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-11 23:41:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 288 transitions. [2022-07-11 23:41:28,584 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 288 transitions. Word has length 50 [2022-07-11 23:41:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:28,584 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 288 transitions. [2022-07-11 23:41:28,584 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-11 23:41:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 288 transitions. [2022-07-11 23:41:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:41:28,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:28,586 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-11 23:41:28,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:41:28,586 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:28,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1943903020, now seen corresponding path program 1 times [2022-07-11 23:41:28,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:28,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984769890] [2022-07-11 23:41:28,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:28,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-11 23:41:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-11 23:41:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,635 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-11 23:41:28,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:28,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984769890] [2022-07-11 23:41:28,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984769890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:28,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:28,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:41:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449855591] [2022-07-11 23:41:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:28,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:41:28,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:28,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:41:28,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:41:28,637 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-11 23:41:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:28,882 INFO L93 Difference]: Finished difference Result 426 states and 705 transitions. [2022-07-11 23:41:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:41:28,882 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-11 23:41:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:28,884 INFO L225 Difference]: With dead ends: 426 [2022-07-11 23:41:28,884 INFO L226 Difference]: Without dead ends: 263 [2022-07-11 23:41:28,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:41:28,887 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-11 23:41:28,887 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-11 23:41:28,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-11 23:41:28,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 181. [2022-07-11 23:41:28,904 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-11 23:41:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 289 transitions. [2022-07-11 23:41:28,905 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 289 transitions. Word has length 52 [2022-07-11 23:41:28,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:28,906 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 289 transitions. [2022-07-11 23:41:28,906 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-11 23:41:28,906 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2022-07-11 23:41:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-11 23:41:28,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:28,907 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-11 23:41:28,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:41:28,908 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:28,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:28,908 INFO L85 PathProgramCache]: Analyzing trace with hash 380344415, now seen corresponding path program 1 times [2022-07-11 23:41:28,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:28,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821174001] [2022-07-11 23:41:28,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:28,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:28,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-11 23:41:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:29,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-11 23:41:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:29,053 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-11 23:41:29,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:29,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821174001] [2022-07-11 23:41:29,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821174001] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:29,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844685745] [2022-07-11 23:41:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:29,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:29,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:29,058 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-11 23:41:29,059 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-11 23:41:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:29,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-11 23:41:29,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:29,259 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-11 23:41:29,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:29,588 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-11 23:41:29,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844685745] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:29,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:29,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2022-07-11 23:41:29,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121374825] [2022-07-11 23:41:29,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:29,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-11 23:41:29,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:29,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-11 23:41:29,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2022-07-11 23:41:29,591 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-11 23:41:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:35,843 INFO L93 Difference]: Finished difference Result 673 states and 1221 transitions. [2022-07-11 23:41:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-11 23:41:35,844 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-11 23:41:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:35,848 INFO L225 Difference]: With dead ends: 673 [2022-07-11 23:41:35,848 INFO L226 Difference]: Without dead ends: 553 [2022-07-11 23:41:35,852 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-11 23:41:35,852 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.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:35,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 812 Invalid, 10356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 10055 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-11 23:41:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-07-11 23:41:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 226. [2022-07-11 23:41:35,885 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-11 23:41:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 409 transitions. [2022-07-11 23:41:35,888 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 409 transitions. Word has length 53 [2022-07-11 23:41:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:35,888 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 409 transitions. [2022-07-11 23:41:35,889 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-11 23:41:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 409 transitions. [2022-07-11 23:41:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-11 23:41:35,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:35,890 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-11 23:41:35,913 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-11 23:41:36,112 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-11 23:41:36,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:36,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2040511084, now seen corresponding path program 1 times [2022-07-11 23:41:36,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:36,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177060311] [2022-07-11 23:41:36,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:36,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:36,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:36,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:36,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:36,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-11 23:41:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:36,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-11 23:41:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:36,185 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-11 23:41:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:36,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177060311] [2022-07-11 23:41:36,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177060311] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:36,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647096056] [2022-07-11 23:41:36,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:36,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:36,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:36,187 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-11 23:41:36,193 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-11 23:41:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:36,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-11 23:41:36,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:36,336 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-11 23:41:36,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:36,489 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-11 23:41:36,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647096056] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:36,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:36,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 20 [2022-07-11 23:41:36,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824222185] [2022-07-11 23:41:36,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:36,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-11 23:41:36,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:36,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-11 23:41:36,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:41:36,491 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-11 23:41:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:38,509 INFO L93 Difference]: Finished difference Result 607 states and 1268 transitions. [2022-07-11 23:41:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-11 23:41:38,513 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-11 23:41:38,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:38,517 INFO L225 Difference]: With dead ends: 607 [2022-07-11 23:41:38,517 INFO L226 Difference]: Without dead ends: 396 [2022-07-11 23:41:38,521 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-11 23:41:38,521 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-11 23:41:38,522 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-11 23:41:38,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-11 23:41:38,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 257. [2022-07-11 23:41:38,555 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-11 23:41:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 495 transitions. [2022-07-11 23:41:38,558 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 495 transitions. Word has length 53 [2022-07-11 23:41:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:38,559 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 495 transitions. [2022-07-11 23:41:38,559 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-11 23:41:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 495 transitions. [2022-07-11 23:41:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-11 23:41:38,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:38,561 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-11 23:41:38,591 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-11 23:41:38,784 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-11 23:41:38,784 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:38,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:38,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1827539848, now seen corresponding path program 1 times [2022-07-11 23:41:38,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:38,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136095770] [2022-07-11 23:41:38,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:38,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:38,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:38,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:38,865 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-11 23:41:38,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:38,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136095770] [2022-07-11 23:41:38,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136095770] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:38,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641705517] [2022-07-11 23:41:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:38,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:38,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:38,867 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-11 23:41:38,897 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-11 23:41:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:38,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:41:38,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:39,015 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-11 23:41:39,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:39,071 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-11 23:41:39,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641705517] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:39,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:39,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-07-11 23:41:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196069399] [2022-07-11 23:41:39,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:39,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 23:41:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 23:41:39,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:41:39,073 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-11 23:41:39,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:39,980 INFO L93 Difference]: Finished difference Result 612 states and 1350 transitions. [2022-07-11 23:41:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:41:39,980 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-11 23:41:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:39,986 INFO L225 Difference]: With dead ends: 612 [2022-07-11 23:41:39,986 INFO L226 Difference]: Without dead ends: 495 [2022-07-11 23:41:39,988 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-11 23:41:39,988 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 225 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:39,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 863 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:41:39,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-07-11 23:41:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 269. [2022-07-11 23:41:40,047 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-11 23:41:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 495 transitions. [2022-07-11 23:41:40,050 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 495 transitions. Word has length 53 [2022-07-11 23:41:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:40,050 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 495 transitions. [2022-07-11 23:41:40,050 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-11 23:41:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 495 transitions. [2022-07-11 23:41:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-11 23:41:40,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:40,053 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-11 23:41:40,079 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-11 23:41:40,279 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-11 23:41:40,279 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2006096899, now seen corresponding path program 1 times [2022-07-11 23:41:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:40,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017570587] [2022-07-11 23:41:40,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:40,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-11 23:41:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-11 23:41:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-11 23:41:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,323 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-11 23:41:40,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:40,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017570587] [2022-07-11 23:41:40,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017570587] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:40,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134832281] [2022-07-11 23:41:40,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:40,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:40,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:40,326 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-11 23:41:40,327 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-11 23:41:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:41:40,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:40,399 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-11 23:41:40,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:40,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134832281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:40,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:41:40,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-11 23:41:40,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69865577] [2022-07-11 23:41:40,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:40,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:41:40,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:40,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:41:40,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:41:40,400 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-11 23:41:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:40,451 INFO L93 Difference]: Finished difference Result 496 states and 887 transitions. [2022-07-11 23:41:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:41:40,452 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-11 23:41:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:40,454 INFO L225 Difference]: With dead ends: 496 [2022-07-11 23:41:40,454 INFO L226 Difference]: Without dead ends: 276 [2022-07-11 23:41:40,456 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-11 23:41:40,457 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-11 23:41:40,457 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-11 23:41:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-11 23:41:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2022-07-11 23:41:40,486 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-11 23:41:40,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 497 transitions. [2022-07-11 23:41:40,490 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 497 transitions. Word has length 54 [2022-07-11 23:41:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:40,490 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 497 transitions. [2022-07-11 23:41:40,490 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-11 23:41:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 497 transitions. [2022-07-11 23:41:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-11 23:41:40,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:40,492 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-11 23:41:40,515 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-11 23:41:40,705 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-11 23:41:40,705 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:40,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:40,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1697379934, now seen corresponding path program 1 times [2022-07-11 23:41:40,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:40,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743335838] [2022-07-11 23:41:40,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:40,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-11 23:41:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:41:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-11 23:41:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:40,980 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-11 23:41:40,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:40,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743335838] [2022-07-11 23:41:40,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743335838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:40,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:40,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-11 23:41:40,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965600634] [2022-07-11 23:41:40,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:40,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 23:41:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:40,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 23:41:40,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:41:40,982 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-11 23:41:42,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:42,326 INFO L93 Difference]: Finished difference Result 399 states and 828 transitions. [2022-07-11 23:41:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-11 23:41:42,327 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-11 23:41:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:42,332 INFO L225 Difference]: With dead ends: 399 [2022-07-11 23:41:42,332 INFO L226 Difference]: Without dead ends: 388 [2022-07-11 23:41:42,333 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-11 23:41:42,334 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 370 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2761 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:42,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 294 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2761 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-11 23:41:42,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-07-11 23:41:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 268. [2022-07-11 23:41:42,378 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-11 23:41:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 494 transitions. [2022-07-11 23:41:42,386 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 494 transitions. Word has length 55 [2022-07-11 23:41:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:42,387 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 494 transitions. [2022-07-11 23:41:42,387 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-11 23:41:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 494 transitions. [2022-07-11 23:41:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:41:42,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:42,389 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-11 23:41:42,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:41:42,389 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:42,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:42,390 INFO L85 PathProgramCache]: Analyzing trace with hash -954910152, now seen corresponding path program 1 times [2022-07-11 23:41:42,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:42,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051615380] [2022-07-11 23:41:42,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:42,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:42,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:42,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:42,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:42,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:42,476 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-11 23:41:42,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:42,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051615380] [2022-07-11 23:41:42,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051615380] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:42,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183271850] [2022-07-11 23:41:42,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:42,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:42,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:42,480 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-11 23:41:42,481 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-11 23:41:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:42,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:41:42,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:42,646 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-11 23:41:42,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:42,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183271850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:42,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:41:42,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-07-11 23:41:42,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81564944] [2022-07-11 23:41:42,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:42,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:41:42,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:42,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:41:42,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:41:42,649 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-11 23:41:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:42,868 INFO L93 Difference]: Finished difference Result 713 states and 1469 transitions. [2022-07-11 23:41:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:41:42,869 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-11 23:41:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:42,874 INFO L225 Difference]: With dead ends: 713 [2022-07-11 23:41:42,874 INFO L226 Difference]: Without dead ends: 656 [2022-07-11 23:41:42,875 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-11 23:41:42,876 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-11 23:41:42,876 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-11 23:41:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-07-11 23:41:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 367. [2022-07-11 23:41:42,931 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-11 23:41:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 626 transitions. [2022-07-11 23:41:42,934 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 626 transitions. Word has length 57 [2022-07-11 23:41:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:42,934 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 626 transitions. [2022-07-11 23:41:42,934 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-11 23:41:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 626 transitions. [2022-07-11 23:41:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:41:42,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:42,937 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-11 23:41:42,959 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-11 23:41:43,159 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-11 23:41:43,159 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:43,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:43,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1347937162, now seen corresponding path program 1 times [2022-07-11 23:41:43,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:43,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768793174] [2022-07-11 23:41:43,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:43,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:43,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:43,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:43,249 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-11 23:41:43,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:43,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768793174] [2022-07-11 23:41:43,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768793174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:43,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337972563] [2022-07-11 23:41:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:43,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:43,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:43,252 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-11 23:41:43,282 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-11 23:41:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:43,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-11 23:41:43,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:43,411 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-11 23:41:43,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:43,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337972563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:43,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:41:43,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-11 23:41:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281198721] [2022-07-11 23:41:43,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:43,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:41:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:43,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:41:43,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:41:43,414 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-11 23:41:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:43,640 INFO L93 Difference]: Finished difference Result 940 states and 1818 transitions. [2022-07-11 23:41:43,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:41:43,641 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-11 23:41:43,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:43,647 INFO L225 Difference]: With dead ends: 940 [2022-07-11 23:41:43,647 INFO L226 Difference]: Without dead ends: 759 [2022-07-11 23:41:43,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2022-07-11 23:41:43,649 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 393 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:43,650 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-11 23:41:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-07-11 23:41:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 429. [2022-07-11 23:41:43,732 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-11 23:41:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 714 transitions. [2022-07-11 23:41:43,734 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 714 transitions. Word has length 57 [2022-07-11 23:41:43,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:43,735 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 714 transitions. [2022-07-11 23:41:43,735 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-11 23:41:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 714 transitions. [2022-07-11 23:41:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:41:43,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:43,737 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-11 23:41:43,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-11 23:41:43,960 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-11 23:41:43,961 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1088923658, now seen corresponding path program 1 times [2022-07-11 23:41:43,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:43,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052186180] [2022-07-11 23:41:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:43,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:44,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:44,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:44,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:44,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:44,047 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-11 23:41:44,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:44,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052186180] [2022-07-11 23:41:44,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052186180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:44,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693175349] [2022-07-11 23:41:44,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:44,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:44,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:44,049 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-11 23:41:44,078 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-11 23:41:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:44,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:41:44,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:44,199 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-11 23:41:44,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:44,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693175349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:44,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:41:44,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-07-11 23:41:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130620714] [2022-07-11 23:41:44,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:44,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:41:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:44,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:41:44,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:41:44,201 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-11 23:41:44,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:44,321 INFO L93 Difference]: Finished difference Result 567 states and 1019 transitions. [2022-07-11 23:41:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:41:44,322 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-11 23:41:44,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:44,324 INFO L225 Difference]: With dead ends: 567 [2022-07-11 23:41:44,325 INFO L226 Difference]: Without dead ends: 476 [2022-07-11 23:41:44,326 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-11 23:41:44,327 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 52 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:44,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:41:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-07-11 23:41:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 353. [2022-07-11 23:41:44,379 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-11 23:41:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 609 transitions. [2022-07-11 23:41:44,381 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 609 transitions. Word has length 57 [2022-07-11 23:41:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:44,381 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 609 transitions. [2022-07-11 23:41:44,381 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-11 23:41:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 609 transitions. [2022-07-11 23:41:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:41:44,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:44,383 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-11 23:41:44,407 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-11 23:41:44,598 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-11 23:41:44,599 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:44,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash 998579127, now seen corresponding path program 2 times [2022-07-11 23:41:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:44,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423556932] [2022-07-11 23:41:44,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:44,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:44,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:44,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:41:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:44,679 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-11 23:41:44,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:44,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423556932] [2022-07-11 23:41:44,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423556932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:44,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:44,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:41:44,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612935334] [2022-07-11 23:41:44,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:44,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:41:44,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:41:44,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:41:44,681 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-11 23:41:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:45,256 INFO L93 Difference]: Finished difference Result 797 states and 1470 transitions. [2022-07-11 23:41:45,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:41:45,258 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-11 23:41:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:45,260 INFO L225 Difference]: With dead ends: 797 [2022-07-11 23:41:45,260 INFO L226 Difference]: Without dead ends: 548 [2022-07-11 23:41:45,264 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-11 23:41:45,265 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 436 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-11 23:41:45,265 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-11 23:41:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-11 23:41:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 454. [2022-07-11 23:41:45,319 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-11 23:41:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 714 transitions. [2022-07-11 23:41:45,321 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 714 transitions. Word has length 57 [2022-07-11 23:41:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:45,321 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 714 transitions. [2022-07-11 23:41:45,321 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-11 23:41:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 714 transitions. [2022-07-11 23:41:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:41:45,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:45,324 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:45,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:41:45,324 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash -12538123, now seen corresponding path program 1 times [2022-07-11 23:41:45,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:45,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776746074] [2022-07-11 23:41:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:45,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:45,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:45,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:41:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:45,395 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-11 23:41:45,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:45,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776746074] [2022-07-11 23:41:45,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776746074] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:45,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415831827] [2022-07-11 23:41:45,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:45,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:45,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:45,412 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-11 23:41:45,421 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-11 23:41:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:45,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:41:45,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:45,512 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-11 23:41:45,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:45,560 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-11 23:41:45,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415831827] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:45,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:41:45,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11, 10] total 12 [2022-07-11 23:41:45,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153552078] [2022-07-11 23:41:45,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:45,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:41:45,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:45,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:41:45,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:41:45,563 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-11 23:41:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:45,614 INFO L93 Difference]: Finished difference Result 773 states and 1335 transitions. [2022-07-11 23:41:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:41:45,614 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-11 23:41:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:45,617 INFO L225 Difference]: With dead ends: 773 [2022-07-11 23:41:45,617 INFO L226 Difference]: Without dead ends: 474 [2022-07-11 23:41:45,621 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-11 23:41:45,622 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-11 23:41:45,622 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-11 23:41:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-11 23:41:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-07-11 23:41:45,672 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-11 23:41:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 732 transitions. [2022-07-11 23:41:45,685 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 732 transitions. Word has length 57 [2022-07-11 23:41:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:45,685 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 732 transitions. [2022-07-11 23:41:45,685 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-11 23:41:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 732 transitions. [2022-07-11 23:41:45,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:41:45,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:45,688 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-11 23:41:45,711 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-11 23:41:45,903 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-11 23:41:45,904 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:45,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash -10691081, now seen corresponding path program 1 times [2022-07-11 23:41:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:45,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453196823] [2022-07-11 23:41:45,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:45,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:46,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:46,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:46,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:41:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:46,159 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-11 23:41:46,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:46,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453196823] [2022-07-11 23:41:46,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453196823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:46,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:46,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-11 23:41:46,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195991009] [2022-07-11 23:41:46,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:46,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-11 23:41:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-11 23:41:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:41:46,161 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-11 23:41:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:46,889 INFO L93 Difference]: Finished difference Result 801 states and 1155 transitions. [2022-07-11 23:41:46,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-11 23:41:46,889 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-11 23:41:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:46,892 INFO L225 Difference]: With dead ends: 801 [2022-07-11 23:41:46,892 INFO L226 Difference]: Without dead ends: 608 [2022-07-11 23:41:46,893 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-11 23:41:46,894 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-11 23:41:46,894 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-11 23:41:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-11 23:41:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 568. [2022-07-11 23:41:46,962 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-11 23:41:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 834 transitions. [2022-07-11 23:41:46,965 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 834 transitions. Word has length 57 [2022-07-11 23:41:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:46,965 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 834 transitions. [2022-07-11 23:41:46,965 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-11 23:41:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 834 transitions. [2022-07-11 23:41:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:41:46,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:46,968 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-11 23:41:46,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:41:46,968 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:46,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1534810419, now seen corresponding path program 1 times [2022-07-11 23:41:46,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:46,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306516653] [2022-07-11 23:41:46,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:46,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:47,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:47,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:47,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-11 23:41:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:47,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-11 23:41:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-11 23:41:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:47,085 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-11 23:41:47,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:47,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306516653] [2022-07-11 23:41:47,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306516653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:47,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579633863] [2022-07-11 23:41:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:47,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:47,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:47,087 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-11 23:41:47,116 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-11 23:41:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:47,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-11 23:41:47,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:47,246 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-11 23:41:47,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:47,459 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-11 23:41:47,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579633863] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:47,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:47,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-07-11 23:41:47,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656826953] [2022-07-11 23:41:47,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:47,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-11 23:41:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:47,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-11 23:41:47,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2022-07-11 23:41:47,461 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-11 23:41:50,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:50,207 INFO L93 Difference]: Finished difference Result 924 states and 1487 transitions. [2022-07-11 23:41:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-11 23:41:50,215 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-11 23:41:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:50,220 INFO L225 Difference]: With dead ends: 924 [2022-07-11 23:41:50,221 INFO L226 Difference]: Without dead ends: 791 [2022-07-11 23:41:50,222 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-11 23:41:50,224 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-11 23:41:50,224 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-11 23:41:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-07-11 23:41:50,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 564. [2022-07-11 23:41:50,308 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-11 23:41:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 818 transitions. [2022-07-11 23:41:50,311 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 818 transitions. Word has length 59 [2022-07-11 23:41:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:50,311 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 818 transitions. [2022-07-11 23:41:50,311 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-11 23:41:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 818 transitions. [2022-07-11 23:41:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:41:50,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:50,314 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-11 23:41:50,338 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-11 23:41:50,523 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-11 23:41:50,523 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:50,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1198827729, now seen corresponding path program 1 times [2022-07-11 23:41:50,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:50,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825670382] [2022-07-11 23:41:50,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:50,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:50,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:50,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-11 23:41:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:50,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-11 23:41:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:50,647 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-11 23:41:50,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:50,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825670382] [2022-07-11 23:41:50,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825670382] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:50,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890801538] [2022-07-11 23:41:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:50,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:50,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:50,649 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-11 23:41:50,682 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-11 23:41:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:50,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-11 23:41:50,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:50,798 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-11 23:41:50,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:50,937 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-11 23:41:50,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890801538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:50,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:50,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-07-11 23:41:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202630015] [2022-07-11 23:41:50,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:50,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-11 23:41:50,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:50,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-11 23:41:50,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:41:50,939 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-11 23:41:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:52,773 INFO L93 Difference]: Finished difference Result 1164 states and 1757 transitions. [2022-07-11 23:41:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-11 23:41:52,774 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-11 23:41:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:52,778 INFO L225 Difference]: With dead ends: 1164 [2022-07-11 23:41:52,778 INFO L226 Difference]: Without dead ends: 869 [2022-07-11 23:41:52,780 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-11 23:41:52,780 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-11 23:41:52,781 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-11 23:41:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-07-11 23:41:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 644. [2022-07-11 23:41:52,877 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-11 23:41:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 872 transitions. [2022-07-11 23:41:52,879 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 872 transitions. Word has length 60 [2022-07-11 23:41:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:52,880 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 872 transitions. [2022-07-11 23:41:52,881 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-11 23:41:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 872 transitions. [2022-07-11 23:41:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-11 23:41:52,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:52,884 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-11 23:41:52,911 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-11 23:41:53,091 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-11 23:41:53,091 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:53,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:53,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1214292501, now seen corresponding path program 1 times [2022-07-11 23:41:53,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:53,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499089462] [2022-07-11 23:41:53,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:53,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:53,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:53,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:41:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:53,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:41:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:53,199 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-11 23:41:53,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:53,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499089462] [2022-07-11 23:41:53,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499089462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:53,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778473594] [2022-07-11 23:41:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:53,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:53,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:53,204 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-11 23:41:53,205 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-11 23:41:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:53,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-11 23:41:53,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:53,361 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-11 23:41:53,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:53,416 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-11 23:41:53,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778473594] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:53,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:53,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-07-11 23:41:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003278022] [2022-07-11 23:41:53,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:53,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-11 23:41:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:53,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-11 23:41:53,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:41:53,418 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-11 23:41:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:54,645 INFO L93 Difference]: Finished difference Result 1351 states and 1983 transitions. [2022-07-11 23:41:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-11 23:41:54,645 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-11 23:41:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:54,650 INFO L225 Difference]: With dead ends: 1351 [2022-07-11 23:41:54,650 INFO L226 Difference]: Without dead ends: 1128 [2022-07-11 23:41:54,651 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-11 23:41:54,652 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-11 23:41:54,652 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-11 23:41:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2022-07-11 23:41:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 617. [2022-07-11 23:41:54,739 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-11 23:41:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 837 transitions. [2022-07-11 23:41:54,741 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 837 transitions. Word has length 61 [2022-07-11 23:41:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:54,742 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 837 transitions. [2022-07-11 23:41:54,742 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-11 23:41:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 837 transitions. [2022-07-11 23:41:54,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:41:54,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:54,744 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-11 23:41:54,771 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-11 23:41:54,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-11 23:41:54,963 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1453926245, now seen corresponding path program 1 times [2022-07-11 23:41:54,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:54,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568999406] [2022-07-11 23:41:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:54,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:55,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:55,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:55,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:55,057 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-11 23:41:55,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:55,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568999406] [2022-07-11 23:41:55,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568999406] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:55,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145441766] [2022-07-11 23:41:55,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:55,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:55,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:55,060 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-11 23:41:55,079 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-11 23:41:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:55,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:41:55,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:55,154 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-11 23:41:55,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:55,210 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-11 23:41:55,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145441766] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:55,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:55,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-07-11 23:41:55,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426847354] [2022-07-11 23:41:55,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:55,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:41:55,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:55,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:41:55,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:41:55,212 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-11 23:41:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:55,759 INFO L93 Difference]: Finished difference Result 1077 states and 1470 transitions. [2022-07-11 23:41:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-11 23:41:55,760 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-11 23:41:55,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:55,763 INFO L225 Difference]: With dead ends: 1077 [2022-07-11 23:41:55,763 INFO L226 Difference]: Without dead ends: 779 [2022-07-11 23:41:55,764 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-11 23:41:55,765 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-11 23:41:55,765 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-11 23:41:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-07-11 23:41:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 610. [2022-07-11 23:41:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 511 states have (on average 1.2015655577299413) internal successors, (614), 532 states have internal predecessors, (614), 65 states have call successors, (65), 11 states have call predecessors, (65), 33 states have return successors, (147), 66 states have call predecessors, (147), 62 states have call successors, (147) [2022-07-11 23:41:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 826 transitions. [2022-07-11 23:41:55,841 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 826 transitions. Word has length 60 [2022-07-11 23:41:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:55,841 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 826 transitions. [2022-07-11 23:41:55,841 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-11 23:41:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 826 transitions. [2022-07-11 23:41:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:41:55,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:55,843 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:55,864 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-11 23:41:56,057 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-11 23:41:56,057 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2131752737, now seen corresponding path program 1 times [2022-07-11 23:41:56,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:56,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753965542] [2022-07-11 23:41:56,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:56,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:56,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:56,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:56,122 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-11 23:41:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:56,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753965542] [2022-07-11 23:41:56,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753965542] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:56,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596990968] [2022-07-11 23:41:56,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:56,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:56,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:56,124 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-11 23:41:56,125 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-11 23:41:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:56,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-11 23:41:56,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:56,291 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-11 23:41:56,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:56,414 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-11 23:41:56,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596990968] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:56,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:56,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-07-11 23:41:56,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18166685] [2022-07-11 23:41:56,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:56,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-11 23:41:56,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:56,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-11 23:41:56,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:41:56,415 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-11 23:41:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:57,572 INFO L93 Difference]: Finished difference Result 1342 states and 1932 transitions. [2022-07-11 23:41:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-11 23:41:57,572 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-11 23:41:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:57,576 INFO L225 Difference]: With dead ends: 1342 [2022-07-11 23:41:57,576 INFO L226 Difference]: Without dead ends: 968 [2022-07-11 23:41:57,579 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-11 23:41:57,579 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 449 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:57,579 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-11 23:41:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-07-11 23:41:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 698. [2022-07-11 23:41:57,683 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-11 23:41:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 928 transitions. [2022-07-11 23:41:57,685 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 928 transitions. Word has length 60 [2022-07-11 23:41:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:57,685 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 928 transitions. [2022-07-11 23:41:57,686 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-11 23:41:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 928 transitions. [2022-07-11 23:41:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:41:57,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:57,688 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-11 23:41:57,713 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-11 23:41:57,903 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-11 23:41:57,903 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1940152897, now seen corresponding path program 1 times [2022-07-11 23:41:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:57,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71373192] [2022-07-11 23:41:57,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:57,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:57,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:57,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:57,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:41:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:57,989 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-11 23:41:57,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:57,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71373192] [2022-07-11 23:41:57,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71373192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:57,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:57,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-11 23:41:57,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336327777] [2022-07-11 23:41:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:57,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:41:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:41:57,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:41:57,992 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-11 23:41:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:59,023 INFO L93 Difference]: Finished difference Result 1624 states and 2442 transitions. [2022-07-11 23:41:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-11 23:41:59,023 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-11 23:41:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:59,028 INFO L225 Difference]: With dead ends: 1624 [2022-07-11 23:41:59,028 INFO L226 Difference]: Without dead ends: 1444 [2022-07-11 23:41:59,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2022-07-11 23:41:59,031 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 323 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:59,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 813 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:41:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-07-11 23:41:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 889. [2022-07-11 23:41:59,157 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-11 23:41:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1174 transitions. [2022-07-11 23:41:59,160 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1174 transitions. Word has length 60 [2022-07-11 23:41:59,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:59,160 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1174 transitions. [2022-07-11 23:41:59,160 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-11 23:41:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1174 transitions. [2022-07-11 23:41:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:41:59,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:59,164 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-11 23:41:59,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:41:59,164 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:59,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1676987907, now seen corresponding path program 1 times [2022-07-11 23:41:59,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:59,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860409510] [2022-07-11 23:41:59,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:59,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:59,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:59,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:59,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:41:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:59,227 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-11 23:41:59,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:59,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860409510] [2022-07-11 23:41:59,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860409510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:59,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:59,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:41:59,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646180299] [2022-07-11 23:41:59,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:59,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:41:59,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:59,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:41:59,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:41:59,230 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-11 23:42:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:00,053 INFO L93 Difference]: Finished difference Result 1900 states and 2818 transitions. [2022-07-11 23:42:00,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-11 23:42:00,054 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-11 23:42:00,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:00,059 INFO L225 Difference]: With dead ends: 1900 [2022-07-11 23:42:00,059 INFO L226 Difference]: Without dead ends: 1583 [2022-07-11 23:42:00,061 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-11 23:42:00,061 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 577 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:42:00,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 569 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:42:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-07-11 23:42:00,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 996. [2022-07-11 23:42:00,226 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-11 23:42:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1311 transitions. [2022-07-11 23:42:00,228 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1311 transitions. Word has length 60 [2022-07-11 23:42:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:00,229 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1311 transitions. [2022-07-11 23:42:00,229 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-11 23:42:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1311 transitions. [2022-07-11 23:42:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:42:00,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:00,231 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-11 23:42:00,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:42:00,232 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:00,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2074166403, now seen corresponding path program 2 times [2022-07-11 23:42:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:42:00,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169297307] [2022-07-11 23:42:00,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:42:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:42:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:42:00,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:42:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:42:00,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:42:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:42:00,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:42:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:42:00,305 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-11 23:42:00,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:42:00,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169297307] [2022-07-11 23:42:00,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169297307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:42:00,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:42:00,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:42:00,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807763490] [2022-07-11 23:42:00,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:42:00,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:42:00,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:42:00,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:42:00,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:42:00,308 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-11 23:42:00,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:00,863 INFO L93 Difference]: Finished difference Result 1368 states and 1904 transitions. [2022-07-11 23:42:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-11 23:42:00,863 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-11 23:42:00,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:00,871 INFO L225 Difference]: With dead ends: 1368 [2022-07-11 23:42:00,871 INFO L226 Difference]: Without dead ends: 1143 [2022-07-11 23:42:00,872 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-11 23:42:00,872 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-11 23:42:00,872 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-11 23:42:00,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-07-11 23:42:01,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 905. [2022-07-11 23:42:01,003 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-11 23:42:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1188 transitions. [2022-07-11 23:42:01,006 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1188 transitions. Word has length 60 [2022-07-11 23:42:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:01,006 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1188 transitions. [2022-07-11 23:42:01,006 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-11 23:42:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1188 transitions. [2022-07-11 23:42:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:42:01,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:01,008 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-11 23:42:01,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-11 23:42:01,009 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1963615586, now seen corresponding path program 1 times [2022-07-11 23:42:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:42:01,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072373114] [2022-07-11 23:42:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:42:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:42:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:42:01,040 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-11 23:42:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:42:01,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-11 23:42:01,079 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-11 23:42:01,080 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:42:01,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-11 23:42:01,084 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-11 23:42:01,087 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:42:01,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:42:01 BoogieIcfgContainer [2022-07-11 23:42:01,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:42:01,158 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:42:01,158 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:42:01,158 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:42:01,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:41:03" (3/4) ... [2022-07-11 23:42:01,161 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-11 23:42:01,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:42:01,161 INFO L158 Benchmark]: Toolchain (without parser) took 58522.77ms. Allocated memory was 88.1MB in the beginning and 226.5MB in the end (delta: 138.4MB). Free memory was 53.8MB in the beginning and 168.9MB in the end (delta: -115.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-11 23:42:01,162 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 88.1MB. Free memory was 58.9MB in the beginning and 58.8MB in the end (delta: 28.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:42:01,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.77ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 53.7MB in the beginning and 79.6MB in the end (delta: -25.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-07-11 23:42:01,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.51ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 78.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:42:01,166 INFO L158 Benchmark]: Boogie Preprocessor took 24.77ms. Allocated memory is still 107.0MB. Free memory was 78.2MB in the beginning and 76.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:42:01,166 INFO L158 Benchmark]: RCFGBuilder took 420.18ms. Allocated memory is still 107.0MB. Free memory was 76.4MB in the beginning and 59.3MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-11 23:42:01,166 INFO L158 Benchmark]: TraceAbstraction took 57738.00ms. Allocated memory was 107.0MB in the beginning and 226.5MB in the end (delta: 119.5MB). Free memory was 59.0MB in the beginning and 168.9MB in the end (delta: -109.9MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2022-07-11 23:42:01,166 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 226.5MB. Free memory is still 168.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:42:01,167 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 88.1MB. Free memory was 58.9MB in the beginning and 58.8MB in the end (delta: 28.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.77ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 53.7MB in the beginning and 79.6MB in the end (delta: -25.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.51ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 78.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.77ms. Allocated memory is still 107.0MB. Free memory was 78.2MB in the beginning and 76.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 420.18ms. Allocated memory is still 107.0MB. Free memory was 76.4MB in the beginning and 59.3MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 57738.00ms. Allocated memory was 107.0MB in the beginning and 226.5MB in the end (delta: 119.5MB). Free memory was 59.0MB in the beginning and 168.9MB in the end (delta: -109.9MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 226.5MB. Free memory is still 168.9MB. 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: 57.6s, OverallIterations: 32, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 41.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12632 SdHoareTripleChecker+Valid, 29.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12343 mSDsluCounter, 17541 SdHoareTripleChecker+Invalid, 24.4s 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.6s 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.0s 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-11 23:42:01,184 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-?-6c24879 [2022-07-11 23:42:03,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:42:03,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:42:03,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:42:03,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:42:03,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:42:03,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:42:03,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:42:03,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:42:03,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:42:03,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:42:03,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:42:03,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:42:03,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:42:03,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:42:03,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:42:03,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:42:03,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:42:03,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:42:03,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:42:03,109 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:42:03,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:42:03,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:42:03,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:42:03,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:42:03,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:42:03,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:42:03,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:42:03,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:42:03,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:42:03,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:42:03,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:42:03,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:42:03,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:42:03,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:42:03,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:42:03,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:42:03,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:42:03,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:42:03,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:42:03,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:42:03,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:42:03,137 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-11 23:42:03,171 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:42:03,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:42:03,172 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:42:03,172 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:42:03,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:42:03,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:42:03,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:42:03,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:42:03,174 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:42:03,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:42:03,175 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:42:03,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:42:03,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:42:03,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:42:03,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:42:03,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:42:03,176 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-11 23:42:03,176 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-11 23:42:03,177 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-11 23:42:03,177 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:42:03,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:42:03,177 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:42:03,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:42:03,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:42:03,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:42:03,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:42:03,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:42:03,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:42:03,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:42:03,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:42:03,179 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-11 23:42:03,179 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-11 23:42:03,180 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:42:03,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:42:03,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:42:03,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-11 23:42:03,180 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-11 23:42:03,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:42:03,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:42:03,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:42:03,507 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:42:03,507 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:42:03,508 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-11 23:42:03,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded2c8fd2/cd0e1603a7f14f7988fd3bcc9939ce88/FLAG1ef6b5a8f [2022-07-11 23:42:04,033 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:42:04,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2022-07-11 23:42:04,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded2c8fd2/cd0e1603a7f14f7988fd3bcc9939ce88/FLAG1ef6b5a8f [2022-07-11 23:42:04,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded2c8fd2/cd0e1603a7f14f7988fd3bcc9939ce88 [2022-07-11 23:42:04,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:42:04,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:42:04,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:42:04,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:42:04,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:42:04,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:42:04" (1/1) ... [2022-07-11 23:42:04,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ebd3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04, skipping insertion in model container [2022-07-11 23:42:04,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:42:04" (1/1) ... [2022-07-11 23:42:04,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:42:04,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:42:04,713 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-11 23:42:04,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:42:04,813 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:42:04,824 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-11 23:42:04,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:42:04,893 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:42:04,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04 WrapperNode [2022-07-11 23:42:04,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:42:04,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:42:04,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:42:04,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:42:04,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04" (1/1) ... [2022-07-11 23:42:04,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04" (1/1) ... [2022-07-11 23:42:04,933 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2022-07-11 23:42:04,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:42:04,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:42:04,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:42:04,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:42:04,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04" (1/1) ... [2022-07-11 23:42:04,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04" (1/1) ... [2022-07-11 23:42:04,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04" (1/1) ... [2022-07-11 23:42:04,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04" (1/1) ... [2022-07-11 23:42:04,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04" (1/1) ... [2022-07-11 23:42:04,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04" (1/1) ... [2022-07-11 23:42:04,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04" (1/1) ... [2022-07-11 23:42:04,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:42:04,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:42:04,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:42:04,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:42:04,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04" (1/1) ... [2022-07-11 23:42:04,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:42:05,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:42:05,018 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-11 23:42:05,044 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-11 23:42:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:42:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-11 23:42:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-11 23:42:05,059 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-11 23:42:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:42:05,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:42:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-11 23:42:05,060 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-11 23:42:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-11 23:42:05,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-11 23:42:05,143 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:42:05,145 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:42:05,397 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:42:05,403 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:42:05,404 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-11 23:42:05,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:42:05 BoogieIcfgContainer [2022-07-11 23:42:05,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:42:05,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:42:05,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:42:05,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:42:05,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:42:04" (1/3) ... [2022-07-11 23:42:05,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531a4812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:42:05, skipping insertion in model container [2022-07-11 23:42:05,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:42:04" (2/3) ... [2022-07-11 23:42:05,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531a4812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:42:05, skipping insertion in model container [2022-07-11 23:42:05,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:42:05" (3/3) ... [2022-07-11 23:42:05,412 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2022-07-11 23:42:05,423 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:42:05,424 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:42:05,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:42:05,480 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@5c7da05d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b137ae3 [2022-07-11 23:42:05,480 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:42:05,484 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-11 23:42:05,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-11 23:42:05,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:05,490 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-11 23:42:05,491 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:05,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:05,494 INFO L85 PathProgramCache]: Analyzing trace with hash 173410466, now seen corresponding path program 1 times [2022-07-11 23:42:05,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:05,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217226213] [2022-07-11 23:42:05,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:42:05,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:05,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:05,504 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-11 23:42:05,505 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-11 23:42:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:42:05,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:42:05,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:05,730 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-11 23:42:05,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:42:05,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:05,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217226213] [2022-07-11 23:42:05,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217226213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:42:05,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:42:05,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:42:05,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285636592] [2022-07-11 23:42:05,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:42:05,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:42:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:05,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:42:05,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:42:05,759 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-11 23:42:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:05,904 INFO L93 Difference]: Finished difference Result 130 states and 196 transitions. [2022-07-11 23:42:05,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:42:05,907 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-11 23:42:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:05,916 INFO L225 Difference]: With dead ends: 130 [2022-07-11 23:42:05,916 INFO L226 Difference]: Without dead ends: 71 [2022-07-11 23:42:05,919 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-11 23:42:05,922 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:42:05,922 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-11 23:42:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-11 23:42:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2022-07-11 23:42:05,957 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-11 23:42:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-07-11 23:42:05,960 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 31 [2022-07-11 23:42:05,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:05,961 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-07-11 23:42:05,961 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-11 23:42:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-07-11 23:42:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 23:42:05,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:05,964 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-11 23:42:05,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-11 23:42:06,167 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-11 23:42:06,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:06,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1707598935, now seen corresponding path program 1 times [2022-07-11 23:42:06,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:06,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440770126] [2022-07-11 23:42:06,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:42:06,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:06,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:06,171 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-11 23:42:06,172 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-11 23:42:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:42:06,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-11 23:42:06,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:06,289 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-11 23:42:06,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:42:06,358 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-11 23:42:06,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:06,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440770126] [2022-07-11 23:42:06,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440770126] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:42:06,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:42:06,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-07-11 23:42:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262947374] [2022-07-11 23:42:06,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:42:06,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:42:06,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:06,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:42:06,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:42:06,368 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-11 23:42:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:06,490 INFO L93 Difference]: Finished difference Result 121 states and 161 transitions. [2022-07-11 23:42:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:42:06,491 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-11 23:42:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:06,493 INFO L225 Difference]: With dead ends: 121 [2022-07-11 23:42:06,493 INFO L226 Difference]: Without dead ends: 93 [2022-07-11 23:42:06,494 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-11 23:42:06,495 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-11 23:42:06,496 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-11 23:42:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-11 23:42:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2022-07-11 23:42:06,506 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-11 23:42:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2022-07-11 23:42:06,507 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 35 [2022-07-11 23:42:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:06,508 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2022-07-11 23:42:06,508 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-11 23:42:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2022-07-11 23:42:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:42:06,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:06,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] [2022-07-11 23:42:06,521 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-11 23:42:06,718 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-11 23:42:06,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1508244029, now seen corresponding path program 1 times [2022-07-11 23:42:06,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:06,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942607905] [2022-07-11 23:42:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:42:06,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:06,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:06,722 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-11 23:42:06,723 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-11 23:42:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:42:06,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:42:06,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:06,859 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-11 23:42:06,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:42:06,903 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-11 23:42:06,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:06,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942607905] [2022-07-11 23:42:06,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942607905] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:42:06,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:42:06,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-11 23:42:06,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834292065] [2022-07-11 23:42:06,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:42:06,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:42:06,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:06,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:42:06,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:42:06,906 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-11 23:42:06,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:06,993 INFO L93 Difference]: Finished difference Result 113 states and 150 transitions. [2022-07-11 23:42:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:42:06,994 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-11 23:42:06,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:07,000 INFO L225 Difference]: With dead ends: 113 [2022-07-11 23:42:07,000 INFO L226 Difference]: Without dead ends: 89 [2022-07-11 23:42:07,003 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-11 23:42:07,006 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-11 23:42:07,007 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-11 23:42:07,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-11 23:42:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2022-07-11 23:42:07,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 61 states have internal predecessors, (74), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2022-07-11 23:42:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2022-07-11 23:42:07,027 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 39 [2022-07-11 23:42:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:07,028 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2022-07-11 23:42:07,028 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-11 23:42:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-07-11 23:42:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:42:07,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:07,034 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-11 23:42:07,045 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-11 23:42:07,245 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-11 23:42:07,245 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:07,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:07,246 INFO L85 PathProgramCache]: Analyzing trace with hash -54729342, now seen corresponding path program 2 times [2022-07-11 23:42:07,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:07,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549443581] [2022-07-11 23:42:07,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:42:07,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:07,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:07,248 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-11 23:42:07,258 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-11 23:42:07,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-11 23:42:07,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:42:07,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-11 23:42:07,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:07,437 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-11 23:42:07,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:42:07,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:07,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549443581] [2022-07-11 23:42:07,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549443581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:42:07,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:42:07,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:42:07,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753502428] [2022-07-11 23:42:07,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:42:07,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:42:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:07,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:42:07,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:42:07,442 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-11 23:42:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:07,506 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2022-07-11 23:42:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:42:07,506 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-11 23:42:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:07,508 INFO L225 Difference]: With dead ends: 96 [2022-07-11 23:42:07,508 INFO L226 Difference]: Without dead ends: 94 [2022-07-11 23:42:07,509 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-11 23:42:07,509 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-11 23:42:07,510 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-11 23:42:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-11 23:42:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2022-07-11 23:42:07,519 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-11 23:42:07,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2022-07-11 23:42:07,520 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 39 [2022-07-11 23:42:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:07,521 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2022-07-11 23:42:07,521 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-11 23:42:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-07-11 23:42:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:42:07,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:07,523 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-11 23:42:07,533 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-11 23:42:07,733 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-11 23:42:07,733 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:07,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:07,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2528960, now seen corresponding path program 1 times [2022-07-11 23:42:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:07,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251708468] [2022-07-11 23:42:07,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:42:07,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:07,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:07,736 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-11 23:42:07,739 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-11 23:42:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:42:07,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:42:07,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:07,881 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-11 23:42:07,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:42:07,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:07,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251708468] [2022-07-11 23:42:07,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251708468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:42:07,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:42:07,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:42:07,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877243885] [2022-07-11 23:42:07,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:42:07,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:42:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:07,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:42:07,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:42:07,884 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-11 23:42:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:07,936 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-07-11 23:42:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:42:07,937 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-11 23:42:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:07,938 INFO L225 Difference]: With dead ends: 96 [2022-07-11 23:42:07,938 INFO L226 Difference]: Without dead ends: 94 [2022-07-11 23:42:07,939 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-11 23:42:07,939 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-11 23:42:07,940 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-11 23:42:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-11 23:42:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-07-11 23:42:07,948 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-11 23:42:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2022-07-11 23:42:07,949 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 39 [2022-07-11 23:42:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:07,949 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2022-07-11 23:42:07,949 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-11 23:42:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2022-07-11 23:42:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:42:07,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:07,950 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-11 23:42:07,962 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-11 23:42:08,159 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-11 23:42:08,160 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:08,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:08,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1837968146, now seen corresponding path program 1 times [2022-07-11 23:42:08,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:08,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675659420] [2022-07-11 23:42:08,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:42:08,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:08,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:08,162 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-11 23:42:08,163 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-11 23:42:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:42:08,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-11 23:42:08,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:08,300 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-11 23:42:08,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:42:08,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:08,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675659420] [2022-07-11 23:42:08,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675659420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:42:08,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:42:08,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:42:08,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531967876] [2022-07-11 23:42:08,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:42:08,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:42:08,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:08,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:42:08,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:42:08,303 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-11 23:42:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:08,521 INFO L93 Difference]: Finished difference Result 126 states and 165 transitions. [2022-07-11 23:42:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:42:08,522 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-11 23:42:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:08,523 INFO L225 Difference]: With dead ends: 126 [2022-07-11 23:42:08,523 INFO L226 Difference]: Without dead ends: 119 [2022-07-11 23:42:08,524 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-11 23:42:08,524 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 33 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:42:08,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 661 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:42:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-11 23:42:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-07-11 23:42:08,535 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-11 23:42:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-07-11 23:42:08,536 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 44 [2022-07-11 23:42:08,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:08,536 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-07-11 23:42:08,537 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-11 23:42:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-07-11 23:42:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-11 23:42:08,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:08,538 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-11 23:42:08,549 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-11 23:42:08,748 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-11 23:42:08,749 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:08,749 INFO L85 PathProgramCache]: Analyzing trace with hash 595859751, now seen corresponding path program 1 times [2022-07-11 23:42:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:08,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766428494] [2022-07-11 23:42:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:42:08,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:08,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:08,751 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-11 23:42:08,752 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-11 23:42:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:42:08,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-11 23:42:08,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:42:08,853 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-11 23:42:08,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:42:08,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:42:08,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766428494] [2022-07-11 23:42:08,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766428494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:42:08,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:42:08,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:42:08,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598514336] [2022-07-11 23:42:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:42:08,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:42:08,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:42:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:42:08,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:42:08,858 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-11 23:42:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:42:08,957 INFO L93 Difference]: Finished difference Result 164 states and 208 transitions. [2022-07-11 23:42:08,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:42:08,958 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-11 23:42:08,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:42:08,959 INFO L225 Difference]: With dead ends: 164 [2022-07-11 23:42:08,959 INFO L226 Difference]: Without dead ends: 127 [2022-07-11 23:42:08,959 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-11 23:42:08,960 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-11 23:42:08,960 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-11 23:42:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-11 23:42:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2022-07-11 23:42:08,968 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-11 23:42:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2022-07-11 23:42:08,969 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 49 [2022-07-11 23:42:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:42:08,970 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2022-07-11 23:42:08,970 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-11 23:42:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2022-07-11 23:42:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:42:08,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:42:08,971 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-11 23:42:08,982 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-11 23:42:09,180 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-11 23:42:09,180 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:42:09,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:42:09,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1849173563, now seen corresponding path program 1 times [2022-07-11 23:42:09,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:42:09,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310289130] [2022-07-11 23:42:09,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:42:09,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:42:09,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:42:09,182 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-11 23:42:09,183 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-11 23:42:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:42:09,224 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-11 23:42:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:42:09,281 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-11 23:42:09,281 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-11 23:42:09,282 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:42:09,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-11 23:42:09,484 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-11 23:42:09,487 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-07-11 23:42:09,490 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:42:09,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:42:09 BoogieIcfgContainer [2022-07-11 23:42:09,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:42:09,518 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:42:09,518 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:42:09,518 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:42:09,519 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:42:05" (3/4) ... [2022-07-11 23:42:09,520 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-11 23:42:09,562 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:42:09,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:42:09,563 INFO L158 Benchmark]: Toolchain (without parser) took 4995.91ms. Allocated memory was 56.6MB in the beginning and 79.7MB in the end (delta: 23.1MB). Free memory was 40.9MB in the beginning and 41.3MB in the end (delta: -313.3kB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2022-07-11 23:42:09,564 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 46.1MB. Free memory was 28.5MB in the beginning and 28.5MB in the end (delta: 32.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:42:09,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.28ms. Allocated memory is still 56.6MB. Free memory was 40.8MB in the beginning and 37.6MB in the end (delta: 3.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-11 23:42:09,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.71ms. Allocated memory is still 56.6MB. Free memory was 37.6MB in the beginning and 36.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:42:09,564 INFO L158 Benchmark]: Boogie Preprocessor took 55.65ms. Allocated memory is still 56.6MB. Free memory was 36.0MB in the beginning and 34.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:42:09,565 INFO L158 Benchmark]: RCFGBuilder took 413.91ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 35.7MB in the end (delta: -1.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2022-07-11 23:42:09,565 INFO L158 Benchmark]: TraceAbstraction took 4110.60ms. Allocated memory was 56.6MB in the beginning and 79.7MB in the end (delta: 23.1MB). Free memory was 35.2MB in the beginning and 44.6MB in the end (delta: -9.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-07-11 23:42:09,565 INFO L158 Benchmark]: Witness Printer took 44.81ms. Allocated memory is still 79.7MB. Free memory was 44.6MB in the beginning and 41.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-11 23:42:09,567 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.16ms. Allocated memory is still 46.1MB. Free memory was 28.5MB in the beginning and 28.5MB in the end (delta: 32.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.28ms. Allocated memory is still 56.6MB. Free memory was 40.8MB in the beginning and 37.6MB in the end (delta: 3.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.71ms. Allocated memory is still 56.6MB. Free memory was 37.6MB in the beginning and 36.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.65ms. Allocated memory is still 56.6MB. Free memory was 36.0MB in the beginning and 34.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 413.91ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 35.7MB in the end (delta: -1.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4110.60ms. Allocated memory was 56.6MB in the beginning and 79.7MB in the end (delta: 23.1MB). Free memory was 35.2MB in the beginning and 44.6MB in the end (delta: -9.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Witness Printer took 44.81ms. Allocated memory is still 79.7MB. Free memory was 44.6MB in the beginning and 41.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L241] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=2147483648, e=0, m=0, res=2147483648] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-2147483648, __retres4=2147483648, e=0, m=0, res=2147483648] [L242] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=-2147483648, ea=0, ma=16777216, zero=0] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=3221225472, e=64, m=0, res=3221225472] [L80] return (__retres4); VAL [\old(e)=64, \old(m)=16777216, \result=-1073741824, __retres4=3221225472, e=64, m=0, res=3221225472] [L243] RET, EXPR base2flt(mb, eb) VAL [a=2147483648, base2flt(mb, eb)=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=2147483648, \old(b)=3221225472] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=2147483648, \old(b)=3221225472, a=2147483648, b=3221225472] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, tmp=2147483648] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L115] delta = ea - eb VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, delta=64, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 3230 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 26 IncrementalHoareTripleChecker+Unchecked, 2747 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 520 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 483 mSDtfsCounter, 520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 95 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.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-11 23:42:09,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE