./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:50:59,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:50:59,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:50:59,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:50:59,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:50:59,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:50:59,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:50:59,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:50:59,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:50:59,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:50:59,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:50:59,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:50:59,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:50:59,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:50:59,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:50:59,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:50:59,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:50:59,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:50:59,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:50:59,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:50:59,597 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:50:59,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:50:59,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:50:59,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:50:59,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:50:59,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:50:59,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:50:59,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:50:59,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:50:59,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:50:59,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:50:59,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:50:59,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:50:59,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:50:59,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:50:59,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:50:59,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:50:59,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:50:59,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:50:59,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:50:59,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:50:59,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:50:59,612 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:50:59,637 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:50:59,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:50:59,638 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:50:59,638 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:50:59,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:50:59,638 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:50:59,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:50:59,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:50:59,639 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:50:59,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:50:59,640 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:50:59,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:50:59,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:50:59,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:50:59,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:50:59,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:50:59,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:50:59,641 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:50:59,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:50:59,643 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:50:59,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:50:59,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:50:59,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:50:59,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:50:59,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:50:59,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:50:59,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:50:59,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:50:59,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:50:59,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:50:59,645 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:50:59,645 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:50:59,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:50:59,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2022-07-19 10:50:59,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:50:59,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:50:59,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:50:59,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:50:59,865 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:50:59,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-19 10:50:59,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7020232f8/ef03f449127c4b048bff4e6ad7aaa550/FLAG16a14ced2 [2022-07-19 10:51:00,282 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:51:00,285 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-19 10:51:00,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7020232f8/ef03f449127c4b048bff4e6ad7aaa550/FLAG16a14ced2 [2022-07-19 10:51:00,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7020232f8/ef03f449127c4b048bff4e6ad7aaa550 [2022-07-19 10:51:00,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:51:00,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:51:00,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:51:00,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:51:00,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:51:00,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:51:00" (1/1) ... [2022-07-19 10:51:00,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f62352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00, skipping insertion in model container [2022-07-19 10:51:00,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:51:00" (1/1) ... [2022-07-19 10:51:00,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:51:00,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:51:00,484 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_1-3a.c.cil.c[730,743] [2022-07-19 10:51:00,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:51:00,556 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:51:00,565 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_1-3a.c.cil.c[730,743] [2022-07-19 10:51:00,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:51:00,627 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:51:00,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00 WrapperNode [2022-07-19 10:51:00,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:51:00,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:51:00,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:51:00,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:51:00,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00" (1/1) ... [2022-07-19 10:51:00,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00" (1/1) ... [2022-07-19 10:51:00,689 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 213 [2022-07-19 10:51:00,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:51:00,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:51:00,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:51:00,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:51:00,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00" (1/1) ... [2022-07-19 10:51:00,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00" (1/1) ... [2022-07-19 10:51:00,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00" (1/1) ... [2022-07-19 10:51:00,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00" (1/1) ... [2022-07-19 10:51:00,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00" (1/1) ... [2022-07-19 10:51:00,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00" (1/1) ... [2022-07-19 10:51:00,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00" (1/1) ... [2022-07-19 10:51:00,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:51:00,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:51:00,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:51:00,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:51:00,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00" (1/1) ... [2022-07-19 10:51:00,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:51:00,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:00,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:51:00,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:51:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:51:00,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:51:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-19 10:51:00,778 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-19 10:51:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:51:00,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:51:00,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 10:51:00,778 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 10:51:00,844 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:51:00,845 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:51:01,203 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:51:01,209 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:51:01,209 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 10:51:01,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:51:01 BoogieIcfgContainer [2022-07-19 10:51:01,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:51:01,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:51:01,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:51:01,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:51:01,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:51:00" (1/3) ... [2022-07-19 10:51:01,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@299141ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:51:01, skipping insertion in model container [2022-07-19 10:51:01,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:00" (2/3) ... [2022-07-19 10:51:01,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@299141ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:51:01, skipping insertion in model container [2022-07-19 10:51:01,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:51:01" (3/3) ... [2022-07-19 10:51:01,221 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2022-07-19 10:51:01,231 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:51:01,231 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:51:01,266 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:51:01,270 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@272a3e95, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f9f8f7e [2022-07-19 10:51:01,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:51:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 96 states have internal predecessors, (160), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-19 10:51:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 10:51:01,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:01,281 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:01,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:01,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:01,285 INFO L85 PathProgramCache]: Analyzing trace with hash 814386124, now seen corresponding path program 1 times [2022-07-19 10:51:01,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:01,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016639343] [2022-07-19 10:51:01,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:01,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:01,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:01,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:01,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016639343] [2022-07-19 10:51:01,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016639343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:01,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:01,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233218392] [2022-07-19 10:51:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:01,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:01,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:01,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:01,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:01,527 INFO L87 Difference]: Start difference. First operand has 106 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 96 states have internal predecessors, (160), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:01,641 INFO L93 Difference]: Finished difference Result 276 states and 481 transitions. [2022-07-19 10:51:01,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:51:01,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-07-19 10:51:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:01,649 INFO L225 Difference]: With dead ends: 276 [2022-07-19 10:51:01,649 INFO L226 Difference]: Without dead ends: 165 [2022-07-19 10:51:01,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:01,654 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 110 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:01,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 419 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-19 10:51:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 147. [2022-07-19 10:51:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 132 states have (on average 1.5) internal successors, (198), 134 states have internal predecessors, (198), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 10:51:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2022-07-19 10:51:01,690 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 37 [2022-07-19 10:51:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:01,690 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2022-07-19 10:51:01,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2022-07-19 10:51:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 10:51:01,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:01,693 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] [2022-07-19 10:51:01,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:51:01,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:01,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2116308935, now seen corresponding path program 1 times [2022-07-19 10:51:01,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:01,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466424738] [2022-07-19 10:51:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:01,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:01,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:01,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:01,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:01,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466424738] [2022-07-19 10:51:01,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466424738] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:01,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:01,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:01,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594097280] [2022-07-19 10:51:01,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:01,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:01,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:01,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:01,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:01,767 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:01,835 INFO L93 Difference]: Finished difference Result 275 states and 414 transitions. [2022-07-19 10:51:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:51:01,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-07-19 10:51:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:01,841 INFO L225 Difference]: With dead ends: 275 [2022-07-19 10:51:01,841 INFO L226 Difference]: Without dead ends: 236 [2022-07-19 10:51:01,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:01,845 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 102 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:01,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 436 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-19 10:51:01,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 219. [2022-07-19 10:51:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 198 states have (on average 1.4595959595959596) internal successors, (289), 201 states have internal predecessors, (289), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-19 10:51:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2022-07-19 10:51:01,865 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 39 [2022-07-19 10:51:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:01,866 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2022-07-19 10:51:01,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2022-07-19 10:51:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 10:51:01,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:01,870 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] [2022-07-19 10:51:01,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:51:01,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:01,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:01,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1123536244, now seen corresponding path program 1 times [2022-07-19 10:51:01,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:01,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902866982] [2022-07-19 10:51:01,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:01,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:01,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:01,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:01,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:01,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:01,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902866982] [2022-07-19 10:51:01,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902866982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:01,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:01,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:51:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944903475] [2022-07-19 10:51:01,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:01,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:51:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:01,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:51:01,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:01,989 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:02,091 INFO L93 Difference]: Finished difference Result 353 states and 525 transitions. [2022-07-19 10:51:02,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:51:02,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-19 10:51:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:02,095 INFO L225 Difference]: With dead ends: 353 [2022-07-19 10:51:02,096 INFO L226 Difference]: Without dead ends: 321 [2022-07-19 10:51:02,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:51:02,099 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 206 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:02,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 702 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-19 10:51:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 273. [2022-07-19 10:51:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 247 states have (on average 1.4615384615384615) internal successors, (361), 251 states have internal predecessors, (361), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-19 10:51:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 405 transitions. [2022-07-19 10:51:02,115 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 405 transitions. Word has length 40 [2022-07-19 10:51:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:02,115 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 405 transitions. [2022-07-19 10:51:02,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 405 transitions. [2022-07-19 10:51:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 10:51:02,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:02,117 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] [2022-07-19 10:51:02,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:51:02,117 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:02,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:02,118 INFO L85 PathProgramCache]: Analyzing trace with hash 102467890, now seen corresponding path program 1 times [2022-07-19 10:51:02,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:02,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268733814] [2022-07-19 10:51:02,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:02,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:02,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:02,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:02,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:02,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268733814] [2022-07-19 10:51:02,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268733814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:02,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:02,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:02,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595748054] [2022-07-19 10:51:02,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:02,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:02,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:02,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:02,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:02,192 INFO L87 Difference]: Start difference. First operand 273 states and 405 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:02,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:02,231 INFO L93 Difference]: Finished difference Result 294 states and 435 transitions. [2022-07-19 10:51:02,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:51:02,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-19 10:51:02,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:02,234 INFO L225 Difference]: With dead ends: 294 [2022-07-19 10:51:02,234 INFO L226 Difference]: Without dead ends: 287 [2022-07-19 10:51:02,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:02,240 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 45 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:02,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 402 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:02,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-19 10:51:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 274. [2022-07-19 10:51:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 248 states have (on average 1.4596774193548387) internal successors, (362), 252 states have internal predecessors, (362), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-19 10:51:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 406 transitions. [2022-07-19 10:51:02,262 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 406 transitions. Word has length 40 [2022-07-19 10:51:02,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:02,262 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 406 transitions. [2022-07-19 10:51:02,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 406 transitions. [2022-07-19 10:51:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 10:51:02,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:02,265 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] [2022-07-19 10:51:02,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:51:02,265 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:02,265 INFO L85 PathProgramCache]: Analyzing trace with hash 991244780, now seen corresponding path program 1 times [2022-07-19 10:51:02,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:02,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738885031] [2022-07-19 10:51:02,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:02,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:02,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:02,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:02,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:02,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:02,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738885031] [2022-07-19 10:51:02,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738885031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:02,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391588347] [2022-07-19 10:51:02,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:02,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:02,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:02,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:02,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:51:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:02,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 10:51:02,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:51:02,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:02,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391588347] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:02,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:02,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 17 [2022-07-19 10:51:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33318033] [2022-07-19 10:51:02,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:02,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:51:02,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:02,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:51:02,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:51:02,745 INFO L87 Difference]: Start difference. First operand 274 states and 406 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-19 10:51:03,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:03,302 INFO L93 Difference]: Finished difference Result 561 states and 855 transitions. [2022-07-19 10:51:03,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 10:51:03,302 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2022-07-19 10:51:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:03,304 INFO L225 Difference]: With dead ends: 561 [2022-07-19 10:51:03,304 INFO L226 Difference]: Without dead ends: 290 [2022-07-19 10:51:03,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-07-19 10:51:03,306 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 467 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:03,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1545 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:51:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-19 10:51:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 173. [2022-07-19 10:51:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 156 states have internal predecessors, (220), 15 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (20), 15 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-19 10:51:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 255 transitions. [2022-07-19 10:51:03,326 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 255 transitions. Word has length 41 [2022-07-19 10:51:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:03,327 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 255 transitions. [2022-07-19 10:51:03,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-19 10:51:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2022-07-19 10:51:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 10:51:03,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:03,331 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:03,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:03,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:03,548 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:03,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash 493844178, now seen corresponding path program 1 times [2022-07-19 10:51:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:03,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103429840] [2022-07-19 10:51:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:03,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:03,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103429840] [2022-07-19 10:51:03,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103429840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:03,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:03,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:51:03,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734943002] [2022-07-19 10:51:03,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:03,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:51:03,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:03,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:51:03,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:03,593 INFO L87 Difference]: Start difference. First operand 173 states and 255 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:03,635 INFO L93 Difference]: Finished difference Result 205 states and 303 transitions. [2022-07-19 10:51:03,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:51:03,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-19 10:51:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:03,636 INFO L225 Difference]: With dead ends: 205 [2022-07-19 10:51:03,637 INFO L226 Difference]: Without dead ends: 179 [2022-07-19 10:51:03,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:51:03,637 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 174 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:03,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 576 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-19 10:51:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2022-07-19 10:51:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 145 states have (on average 1.4206896551724137) internal successors, (206), 147 states have internal predecessors, (206), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-07-19 10:51:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 237 transitions. [2022-07-19 10:51:03,644 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 237 transitions. Word has length 43 [2022-07-19 10:51:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:03,645 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 237 transitions. [2022-07-19 10:51:03,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 237 transitions. [2022-07-19 10:51:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:51:03,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:03,646 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] [2022-07-19 10:51:03,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:51:03,646 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:03,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1964302618, now seen corresponding path program 1 times [2022-07-19 10:51:03,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:03,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973758490] [2022-07-19 10:51:03,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:03,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:03,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:03,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973758490] [2022-07-19 10:51:03,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973758490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:03,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:03,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:51:03,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598057042] [2022-07-19 10:51:03,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:03,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:51:03,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:03,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:51:03,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:03,677 INFO L87 Difference]: Start difference. First operand 163 states and 237 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:03,724 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2022-07-19 10:51:03,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:51:03,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-19 10:51:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:03,727 INFO L225 Difference]: With dead ends: 185 [2022-07-19 10:51:03,728 INFO L226 Difference]: Without dead ends: 178 [2022-07-19 10:51:03,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:51:03,729 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 54 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:03,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 536 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:03,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-19 10:51:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2022-07-19 10:51:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 146 states have (on average 1.417808219178082) internal successors, (207), 148 states have internal predecessors, (207), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-07-19 10:51:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 238 transitions. [2022-07-19 10:51:03,738 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 238 transitions. Word has length 44 [2022-07-19 10:51:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:03,738 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 238 transitions. [2022-07-19 10:51:03,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 238 transitions. [2022-07-19 10:51:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:51:03,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:03,739 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] [2022-07-19 10:51:03,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:51:03,739 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:03,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:03,740 INFO L85 PathProgramCache]: Analyzing trace with hash -189295256, now seen corresponding path program 1 times [2022-07-19 10:51:03,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:03,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523144930] [2022-07-19 10:51:03,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:03,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:03,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523144930] [2022-07-19 10:51:03,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523144930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:03,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:03,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:51:03,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815810085] [2022-07-19 10:51:03,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:03,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:51:03,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:03,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:51:03,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:51:03,800 INFO L87 Difference]: Start difference. First operand 164 states and 238 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:03,853 INFO L93 Difference]: Finished difference Result 179 states and 258 transitions. [2022-07-19 10:51:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:51:03,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-19 10:51:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:03,855 INFO L225 Difference]: With dead ends: 179 [2022-07-19 10:51:03,856 INFO L226 Difference]: Without dead ends: 172 [2022-07-19 10:51:03,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:51:03,856 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 42 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:03,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 678 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-19 10:51:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-07-19 10:51:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 144 states have (on average 1.4097222222222223) internal successors, (203), 146 states have internal predecessors, (203), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-07-19 10:51:03,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2022-07-19 10:51:03,867 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2022-07-19 10:51:03,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:03,867 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2022-07-19 10:51:03,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2022-07-19 10:51:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:51:03,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:03,868 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] [2022-07-19 10:51:03,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:51:03,869 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:03,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1232722459, now seen corresponding path program 1 times [2022-07-19 10:51:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:03,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926402692] [2022-07-19 10:51:03,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:03,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:03,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926402692] [2022-07-19 10:51:03,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926402692] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:03,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604924629] [2022-07-19 10:51:03,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:03,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:03,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:03,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:03,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:51:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:04,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 10:51:04,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:51:04,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:04,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604924629] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:04,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:51:04,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 17 [2022-07-19 10:51:04,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039584721] [2022-07-19 10:51:04,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:04,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:51:04,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:04,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:51:04,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:51:04,181 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:04,258 INFO L93 Difference]: Finished difference Result 392 states and 564 transitions. [2022-07-19 10:51:04,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:51:04,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-19 10:51:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:04,260 INFO L225 Difference]: With dead ends: 392 [2022-07-19 10:51:04,261 INFO L226 Difference]: Without dead ends: 280 [2022-07-19 10:51:04,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:51:04,263 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 85 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:04,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 707 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-19 10:51:04,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 276. [2022-07-19 10:51:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 250 states have (on average 1.392) internal successors, (348), 251 states have internal predecessors, (348), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-19 10:51:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 395 transitions. [2022-07-19 10:51:04,276 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 395 transitions. Word has length 45 [2022-07-19 10:51:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:04,277 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 395 transitions. [2022-07-19 10:51:04,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 395 transitions. [2022-07-19 10:51:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:51:04,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:04,278 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] [2022-07-19 10:51:04,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:04,491 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,SelfDestructingSolverStorable8 [2022-07-19 10:51:04,491 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:04,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash 221605209, now seen corresponding path program 1 times [2022-07-19 10:51:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:04,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669182902] [2022-07-19 10:51:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:04,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:04,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:04,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:04,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669182902] [2022-07-19 10:51:04,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669182902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:04,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:04,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:51:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430734611] [2022-07-19 10:51:04,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:04,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:51:04,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:04,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:51:04,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:04,520 INFO L87 Difference]: Start difference. First operand 276 states and 395 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:04,565 INFO L93 Difference]: Finished difference Result 422 states and 604 transitions. [2022-07-19 10:51:04,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:51:04,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-19 10:51:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:04,567 INFO L225 Difference]: With dead ends: 422 [2022-07-19 10:51:04,567 INFO L226 Difference]: Without dead ends: 382 [2022-07-19 10:51:04,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:51:04,568 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 186 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:04,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 538 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:04,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-07-19 10:51:04,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 311. [2022-07-19 10:51:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 284 states have (on average 1.3873239436619718) internal successors, (394), 284 states have internal predecessors, (394), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (27), 24 states have call predecessors, (27), 21 states have call successors, (27) [2022-07-19 10:51:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 443 transitions. [2022-07-19 10:51:04,580 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 443 transitions. Word has length 45 [2022-07-19 10:51:04,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:04,581 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 443 transitions. [2022-07-19 10:51:04,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 443 transitions. [2022-07-19 10:51:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:51:04,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:04,582 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, 1, 1] [2022-07-19 10:51:04,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:51:04,582 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2044635565, now seen corresponding path program 1 times [2022-07-19 10:51:04,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:04,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962804179] [2022-07-19 10:51:04,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:04,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:04,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:04,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:04,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:04,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:04,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962804179] [2022-07-19 10:51:04,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962804179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:04,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713052834] [2022-07-19 10:51:04,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:04,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:04,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:04,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:04,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:51:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:04,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 10:51:04,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:04,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:04,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713052834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:04,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:51:04,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-19 10:51:04,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155846103] [2022-07-19 10:51:04,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:04,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:51:04,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:04,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:51:04,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:51:04,791 INFO L87 Difference]: Start difference. First operand 311 states and 443 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:04,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:04,916 INFO L93 Difference]: Finished difference Result 613 states and 868 transitions. [2022-07-19 10:51:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:51:04,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-07-19 10:51:04,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:04,920 INFO L225 Difference]: With dead ends: 613 [2022-07-19 10:51:04,920 INFO L226 Difference]: Without dead ends: 587 [2022-07-19 10:51:04,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:51:04,921 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 181 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:04,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 745 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:04,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-07-19 10:51:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 467. [2022-07-19 10:51:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 428 states have (on average 1.3574766355140186) internal successors, (581), 429 states have internal predecessors, (581), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-07-19 10:51:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 654 transitions. [2022-07-19 10:51:04,939 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 654 transitions. Word has length 48 [2022-07-19 10:51:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:04,939 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 654 transitions. [2022-07-19 10:51:04,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 654 transitions. [2022-07-19 10:51:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:51:04,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:04,940 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, 1, 1] [2022-07-19 10:51:04,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:05,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:05,147 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:05,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:05,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1343570987, now seen corresponding path program 1 times [2022-07-19 10:51:05,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:05,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44213961] [2022-07-19 10:51:05,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:05,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:05,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:05,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44213961] [2022-07-19 10:51:05,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44213961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:05,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:05,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:51:05,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817237027] [2022-07-19 10:51:05,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:05,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:51:05,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:05,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:51:05,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:05,177 INFO L87 Difference]: Start difference. First operand 467 states and 654 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:05,214 INFO L93 Difference]: Finished difference Result 491 states and 685 transitions. [2022-07-19 10:51:05,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:51:05,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-07-19 10:51:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:05,216 INFO L225 Difference]: With dead ends: 491 [2022-07-19 10:51:05,216 INFO L226 Difference]: Without dead ends: 451 [2022-07-19 10:51:05,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:51:05,217 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 38 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:05,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 528 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:05,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-07-19 10:51:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 443. [2022-07-19 10:51:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 404 states have (on average 1.3514851485148516) internal successors, (546), 405 states have internal predecessors, (546), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (38), 35 states have call predecessors, (38), 32 states have call successors, (38) [2022-07-19 10:51:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 618 transitions. [2022-07-19 10:51:05,235 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 618 transitions. Word has length 48 [2022-07-19 10:51:05,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:05,236 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 618 transitions. [2022-07-19 10:51:05,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 618 transitions. [2022-07-19 10:51:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:51:05,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:05,237 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, 1, 1] [2022-07-19 10:51:05,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:51:05,237 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:05,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:05,237 INFO L85 PathProgramCache]: Analyzing trace with hash 502143871, now seen corresponding path program 1 times [2022-07-19 10:51:05,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:05,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271442331] [2022-07-19 10:51:05,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:05,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:05,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271442331] [2022-07-19 10:51:05,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271442331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:05,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:05,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:05,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448530784] [2022-07-19 10:51:05,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:05,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:05,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:05,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:05,265 INFO L87 Difference]: Start difference. First operand 443 states and 618 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:05,321 INFO L93 Difference]: Finished difference Result 840 states and 1171 transitions. [2022-07-19 10:51:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:51:05,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-07-19 10:51:05,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:05,323 INFO L225 Difference]: With dead ends: 840 [2022-07-19 10:51:05,323 INFO L226 Difference]: Without dead ends: 524 [2022-07-19 10:51:05,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:05,324 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 75 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:05,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 426 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-07-19 10:51:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 448. [2022-07-19 10:51:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 409 states have (on average 1.3227383863080684) internal successors, (541), 410 states have internal predecessors, (541), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (38), 35 states have call predecessors, (38), 32 states have call successors, (38) [2022-07-19 10:51:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 613 transitions. [2022-07-19 10:51:05,338 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 613 transitions. Word has length 48 [2022-07-19 10:51:05,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:05,338 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 613 transitions. [2022-07-19 10:51:05,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 613 transitions. [2022-07-19 10:51:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:51:05,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:05,339 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, 1, 1] [2022-07-19 10:51:05,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:51:05,339 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:05,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:05,340 INFO L85 PathProgramCache]: Analyzing trace with hash -50490859, now seen corresponding path program 1 times [2022-07-19 10:51:05,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:05,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835347507] [2022-07-19 10:51:05,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:05,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:05,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:05,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835347507] [2022-07-19 10:51:05,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835347507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:05,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:05,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 10:51:05,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862406695] [2022-07-19 10:51:05,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:05,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:51:05,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:05,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:51:05,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:51:05,415 INFO L87 Difference]: Start difference. First operand 448 states and 613 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:05,596 INFO L93 Difference]: Finished difference Result 622 states and 846 transitions. [2022-07-19 10:51:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:51:05,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-07-19 10:51:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:05,598 INFO L225 Difference]: With dead ends: 622 [2022-07-19 10:51:05,598 INFO L226 Difference]: Without dead ends: 533 [2022-07-19 10:51:05,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:51:05,599 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 122 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:05,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1660 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:05,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-07-19 10:51:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 445. [2022-07-19 10:51:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 406 states have (on average 1.3251231527093597) internal successors, (538), 408 states have internal predecessors, (538), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-07-19 10:51:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 608 transitions. [2022-07-19 10:51:05,611 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 608 transitions. Word has length 48 [2022-07-19 10:51:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:05,611 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 608 transitions. [2022-07-19 10:51:05,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 608 transitions. [2022-07-19 10:51:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 10:51:05,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:05,612 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] [2022-07-19 10:51:05,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:51:05,613 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1297236278, now seen corresponding path program 1 times [2022-07-19 10:51:05,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:05,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520410574] [2022-07-19 10:51:05,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:05,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:51:05,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:05,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520410574] [2022-07-19 10:51:05,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520410574] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:05,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843952375] [2022-07-19 10:51:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:05,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:05,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:05,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:05,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 10:51:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:05,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 10:51:05,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:51:05,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:51:05,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843952375] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:05,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:05,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-07-19 10:51:05,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214431903] [2022-07-19 10:51:05,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:05,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:51:05,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:05,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:51:05,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:51:05,890 INFO L87 Difference]: Start difference. First operand 445 states and 608 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:51:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:06,336 INFO L93 Difference]: Finished difference Result 1186 states and 1619 transitions. [2022-07-19 10:51:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:51:06,337 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2022-07-19 10:51:06,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:06,339 INFO L225 Difference]: With dead ends: 1186 [2022-07-19 10:51:06,339 INFO L226 Difference]: Without dead ends: 808 [2022-07-19 10:51:06,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:51:06,341 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 551 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:06,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 2129 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:51:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-07-19 10:51:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 644. [2022-07-19 10:51:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 589 states have (on average 1.2767402376910018) internal successors, (752), 592 states have internal predecessors, (752), 49 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (56), 50 states have call predecessors, (56), 46 states have call successors, (56) [2022-07-19 10:51:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 857 transitions. [2022-07-19 10:51:06,363 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 857 transitions. Word has length 49 [2022-07-19 10:51:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:06,364 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 857 transitions. [2022-07-19 10:51:06,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:51:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 857 transitions. [2022-07-19 10:51:06,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:51:06,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:06,365 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:06,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:06,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 10:51:06,567 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:06,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2012462520, now seen corresponding path program 1 times [2022-07-19 10:51:06,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:06,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747033970] [2022-07-19 10:51:06,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:06,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:06,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:06,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:06,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 10:51:06,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:06,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747033970] [2022-07-19 10:51:06,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747033970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:06,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526465555] [2022-07-19 10:51:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:06,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:06,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:06,816 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:06,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 10:51:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:06,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-19 10:51:06,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:07,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:07,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526465555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:07,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:51:07,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 24 [2022-07-19 10:51:07,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032872515] [2022-07-19 10:51:07,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:07,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:51:07,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:07,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:51:07,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2022-07-19 10:51:07,031 INFO L87 Difference]: Start difference. First operand 644 states and 857 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:07,264 INFO L93 Difference]: Finished difference Result 842 states and 1127 transitions. [2022-07-19 10:51:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:51:07,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-19 10:51:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:07,267 INFO L225 Difference]: With dead ends: 842 [2022-07-19 10:51:07,267 INFO L226 Difference]: Without dead ends: 823 [2022-07-19 10:51:07,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2022-07-19 10:51:07,268 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 284 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:07,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1167 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:51:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-07-19 10:51:07,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 673. [2022-07-19 10:51:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 616 states have (on average 1.271103896103896) internal successors, (783), 620 states have internal predecessors, (783), 51 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (58), 52 states have call predecessors, (58), 48 states have call successors, (58) [2022-07-19 10:51:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 892 transitions. [2022-07-19 10:51:07,290 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 892 transitions. Word has length 50 [2022-07-19 10:51:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:07,290 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 892 transitions. [2022-07-19 10:51:07,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 892 transitions. [2022-07-19 10:51:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 10:51:07,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:07,292 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] [2022-07-19 10:51:07,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:07,509 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,SelfDestructingSolverStorable15 [2022-07-19 10:51:07,509 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:07,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:07,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1388940720, now seen corresponding path program 1 times [2022-07-19 10:51:07,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:07,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822872612] [2022-07-19 10:51:07,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:07,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:51:07,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:07,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822872612] [2022-07-19 10:51:07,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822872612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:07,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:07,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:51:07,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807029182] [2022-07-19 10:51:07,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:07,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:51:07,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:07,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:51:07,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:51:07,546 INFO L87 Difference]: Start difference. First operand 673 states and 892 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:07,623 INFO L93 Difference]: Finished difference Result 726 states and 965 transitions. [2022-07-19 10:51:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:51:07,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-07-19 10:51:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:07,634 INFO L225 Difference]: With dead ends: 726 [2022-07-19 10:51:07,634 INFO L226 Difference]: Without dead ends: 724 [2022-07-19 10:51:07,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:51:07,635 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 78 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:07,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 840 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-07-19 10:51:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 682. [2022-07-19 10:51:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 621 states have (on average 1.2689210950080516) internal successors, (788), 628 states have internal predecessors, (788), 54 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (61), 52 states have call predecessors, (61), 51 states have call successors, (61) [2022-07-19 10:51:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 903 transitions. [2022-07-19 10:51:07,658 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 903 transitions. Word has length 51 [2022-07-19 10:51:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:07,658 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 903 transitions. [2022-07-19 10:51:07,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 903 transitions. [2022-07-19 10:51:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 10:51:07,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:07,659 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] [2022-07-19 10:51:07,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:51:07,660 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:07,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1800205628, now seen corresponding path program 1 times [2022-07-19 10:51:07,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:07,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236761548] [2022-07-19 10:51:07,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:07,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:07,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:07,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236761548] [2022-07-19 10:51:07,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236761548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:07,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:07,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:51:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618863901] [2022-07-19 10:51:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:07,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:51:07,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:51:07,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:07,688 INFO L87 Difference]: Start difference. First operand 682 states and 903 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:07,731 INFO L93 Difference]: Finished difference Result 699 states and 926 transitions. [2022-07-19 10:51:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:51:07,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2022-07-19 10:51:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:07,734 INFO L225 Difference]: With dead ends: 699 [2022-07-19 10:51:07,734 INFO L226 Difference]: Without dead ends: 673 [2022-07-19 10:51:07,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:51:07,735 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 38 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:07,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 516 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-07-19 10:51:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 567. [2022-07-19 10:51:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 515 states have (on average 1.2757281553398059) internal successors, (657), 521 states have internal predecessors, (657), 45 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (52), 43 states have call predecessors, (52), 42 states have call successors, (52) [2022-07-19 10:51:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 754 transitions. [2022-07-19 10:51:07,755 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 754 transitions. Word has length 52 [2022-07-19 10:51:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:07,755 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 754 transitions. [2022-07-19 10:51:07,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 754 transitions. [2022-07-19 10:51:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:51:07,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:07,756 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, 1, 1] [2022-07-19 10:51:07,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 10:51:07,756 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:07,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:07,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2067118233, now seen corresponding path program 1 times [2022-07-19 10:51:07,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:07,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742461840] [2022-07-19 10:51:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:07,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 10:51:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:51:07,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:07,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742461840] [2022-07-19 10:51:07,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742461840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:07,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:07,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:51:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290936953] [2022-07-19 10:51:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:07,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:51:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:07,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:51:07,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:51:07,836 INFO L87 Difference]: Start difference. First operand 567 states and 754 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:51:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:08,034 INFO L93 Difference]: Finished difference Result 1253 states and 1690 transitions. [2022-07-19 10:51:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:51:08,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-19 10:51:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:08,038 INFO L225 Difference]: With dead ends: 1253 [2022-07-19 10:51:08,038 INFO L226 Difference]: Without dead ends: 1047 [2022-07-19 10:51:08,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:51:08,039 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 184 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:08,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1360 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:08,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2022-07-19 10:51:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 916. [2022-07-19 10:51:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 840 states have (on average 1.2642857142857142) internal successors, (1062), 847 states have internal predecessors, (1062), 69 states have call successors, (69), 4 states have call predecessors, (69), 6 states have return successors, (76), 68 states have call predecessors, (76), 66 states have call successors, (76) [2022-07-19 10:51:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1207 transitions. [2022-07-19 10:51:08,068 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1207 transitions. Word has length 57 [2022-07-19 10:51:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:08,068 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 1207 transitions. [2022-07-19 10:51:08,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:51:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1207 transitions. [2022-07-19 10:51:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 10:51:08,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:08,070 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, 1, 1, 1, 1, 1] [2022-07-19 10:51:08,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 10:51:08,070 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:08,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1155927203, now seen corresponding path program 1 times [2022-07-19 10:51:08,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:08,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547242052] [2022-07-19 10:51:08,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:08,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:08,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:08,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:08,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:08,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547242052] [2022-07-19 10:51:08,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547242052] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:08,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546238371] [2022-07-19 10:51:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:08,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:08,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:08,129 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:08,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 10:51:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:08,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:51:08,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:08,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:08,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546238371] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:08,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:08,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-07-19 10:51:08,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266212126] [2022-07-19 10:51:08,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:08,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:51:08,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:08,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:51:08,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:51:08,281 INFO L87 Difference]: Start difference. First operand 916 states and 1207 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:51:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:08,498 INFO L93 Difference]: Finished difference Result 1645 states and 2177 transitions. [2022-07-19 10:51:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:51:08,499 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2022-07-19 10:51:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:08,503 INFO L225 Difference]: With dead ends: 1645 [2022-07-19 10:51:08,503 INFO L226 Difference]: Without dead ends: 1543 [2022-07-19 10:51:08,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:51:08,505 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 301 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:08,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 2254 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-07-19 10:51:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 928. [2022-07-19 10:51:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 852 states have (on average 1.2629107981220657) internal successors, (1076), 859 states have internal predecessors, (1076), 69 states have call successors, (69), 4 states have call predecessors, (69), 6 states have return successors, (76), 68 states have call predecessors, (76), 66 states have call successors, (76) [2022-07-19 10:51:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1221 transitions. [2022-07-19 10:51:08,545 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1221 transitions. Word has length 58 [2022-07-19 10:51:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:08,545 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 1221 transitions. [2022-07-19 10:51:08,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:51:08,546 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1221 transitions. [2022-07-19 10:51:08,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 10:51:08,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:08,547 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, 1, 1, 1, 1, 1] [2022-07-19 10:51:08,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:08,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:08,763 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:08,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:08,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1021913697, now seen corresponding path program 1 times [2022-07-19 10:51:08,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:08,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233235341] [2022-07-19 10:51:08,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:08,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:08,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:08,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:08,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:08,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233235341] [2022-07-19 10:51:08,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233235341] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:08,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337594545] [2022-07-19 10:51:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:08,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:08,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:08,813 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:08,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 10:51:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:08,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:51:08,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:08,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:08,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337594545] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:08,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:08,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-07-19 10:51:08,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255661660] [2022-07-19 10:51:08,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:08,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 10:51:08,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:08,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 10:51:08,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:51:08,992 INFO L87 Difference]: Start difference. First operand 928 states and 1221 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:51:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:09,301 INFO L93 Difference]: Finished difference Result 2168 states and 2928 transitions. [2022-07-19 10:51:09,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:51:09,302 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2022-07-19 10:51:09,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:09,307 INFO L225 Difference]: With dead ends: 2168 [2022-07-19 10:51:09,307 INFO L226 Difference]: Without dead ends: 2046 [2022-07-19 10:51:09,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-07-19 10:51:09,309 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 257 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:09,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 3240 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:51:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2022-07-19 10:51:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 908. [2022-07-19 10:51:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 833 states have (on average 1.2665066026410565) internal successors, (1055), 842 states have internal predecessors, (1055), 68 states have call successors, (68), 4 states have call predecessors, (68), 6 states have return successors, (72), 65 states have call predecessors, (72), 65 states have call successors, (72) [2022-07-19 10:51:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1195 transitions. [2022-07-19 10:51:09,347 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1195 transitions. Word has length 58 [2022-07-19 10:51:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:09,347 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1195 transitions. [2022-07-19 10:51:09,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:51:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1195 transitions. [2022-07-19 10:51:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 10:51:09,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:09,348 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, 1, 1, 1, 1, 1] [2022-07-19 10:51:09,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:09,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:09,558 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1110635549, now seen corresponding path program 1 times [2022-07-19 10:51:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:09,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985618437] [2022-07-19 10:51:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:09,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:09,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:09,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:09,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:09,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985618437] [2022-07-19 10:51:09,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985618437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:09,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:09,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:51:09,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29614086] [2022-07-19 10:51:09,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:09,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:51:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:09,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:51:09,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:51:09,607 INFO L87 Difference]: Start difference. First operand 908 states and 1195 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:09,733 INFO L93 Difference]: Finished difference Result 958 states and 1256 transitions. [2022-07-19 10:51:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:51:09,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2022-07-19 10:51:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:09,737 INFO L225 Difference]: With dead ends: 958 [2022-07-19 10:51:09,737 INFO L226 Difference]: Without dead ends: 752 [2022-07-19 10:51:09,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:51:09,738 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 44 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:09,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 869 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-07-19 10:51:09,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 744. [2022-07-19 10:51:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 679 states have (on average 1.2709867452135493) internal successors, (863), 689 states have internal predecessors, (863), 59 states have call successors, (59), 4 states have call predecessors, (59), 5 states have return successors, (59), 54 states have call predecessors, (59), 56 states have call successors, (59) [2022-07-19 10:51:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 981 transitions. [2022-07-19 10:51:09,764 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 981 transitions. Word has length 58 [2022-07-19 10:51:09,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:09,765 INFO L495 AbstractCegarLoop]: Abstraction has 744 states and 981 transitions. [2022-07-19 10:51:09,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 981 transitions. [2022-07-19 10:51:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 10:51:09,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:09,766 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:09,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 10:51:09,766 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:09,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:09,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1691045042, now seen corresponding path program 1 times [2022-07-19 10:51:09,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:09,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089563011] [2022-07-19 10:51:09,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:09,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:09,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:09,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:09,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 10:51:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:09,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:09,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089563011] [2022-07-19 10:51:09,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089563011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:09,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:09,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:09,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910737016] [2022-07-19 10:51:09,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:09,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:09,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:09,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:09,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:09,793 INFO L87 Difference]: Start difference. First operand 744 states and 981 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:51:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:09,856 INFO L93 Difference]: Finished difference Result 1373 states and 1824 transitions. [2022-07-19 10:51:09,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:51:09,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2022-07-19 10:51:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:09,859 INFO L225 Difference]: With dead ends: 1373 [2022-07-19 10:51:09,859 INFO L226 Difference]: Without dead ends: 764 [2022-07-19 10:51:09,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:09,860 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 55 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:09,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 355 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-07-19 10:51:09,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 745. [2022-07-19 10:51:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 680 states have (on average 1.2705882352941176) internal successors, (864), 690 states have internal predecessors, (864), 59 states have call successors, (59), 4 states have call predecessors, (59), 5 states have return successors, (59), 54 states have call predecessors, (59), 56 states have call successors, (59) [2022-07-19 10:51:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 982 transitions. [2022-07-19 10:51:09,885 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 982 transitions. Word has length 59 [2022-07-19 10:51:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:09,885 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 982 transitions. [2022-07-19 10:51:09,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:51:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 982 transitions. [2022-07-19 10:51:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:51:09,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:09,887 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:09,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 10:51:09,887 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1304426309, now seen corresponding path program 1 times [2022-07-19 10:51:09,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:09,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935142683] [2022-07-19 10:51:09,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:09,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:09,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:09,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:10,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 10:51:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:10,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935142683] [2022-07-19 10:51:10,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935142683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:10,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537942590] [2022-07-19 10:51:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:10,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:10,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:10,008 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:10,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 10:51:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:10,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-19 10:51:10,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 10:51:10,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:10,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537942590] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:10,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:51:10,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 26 [2022-07-19 10:51:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474044020] [2022-07-19 10:51:10,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:10,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:51:10,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:10,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:51:10,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2022-07-19 10:51:10,641 INFO L87 Difference]: Start difference. First operand 745 states and 982 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:51:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:11,002 INFO L93 Difference]: Finished difference Result 1182 states and 1559 transitions. [2022-07-19 10:51:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:51:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2022-07-19 10:51:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:11,005 INFO L225 Difference]: With dead ends: 1182 [2022-07-19 10:51:11,006 INFO L226 Difference]: Without dead ends: 1147 [2022-07-19 10:51:11,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 10:51:11,007 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 242 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:11,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1707 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:51:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-07-19 10:51:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1000. [2022-07-19 10:51:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 912 states have (on average 1.2763157894736843) internal successors, (1164), 923 states have internal predecessors, (1164), 81 states have call successors, (81), 4 states have call predecessors, (81), 6 states have return successors, (84), 77 states have call predecessors, (84), 78 states have call successors, (84) [2022-07-19 10:51:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1329 transitions. [2022-07-19 10:51:11,053 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1329 transitions. Word has length 60 [2022-07-19 10:51:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:11,053 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1329 transitions. [2022-07-19 10:51:11,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:51:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1329 transitions. [2022-07-19 10:51:11,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 10:51:11,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:11,054 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:11,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:11,267 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,SelfDestructingSolverStorable23 [2022-07-19 10:51:11,268 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:11,268 INFO L85 PathProgramCache]: Analyzing trace with hash -339625375, now seen corresponding path program 1 times [2022-07-19 10:51:11,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:11,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806855583] [2022-07-19 10:51:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 10:51:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 10:51:11,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:11,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806855583] [2022-07-19 10:51:11,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806855583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:11,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:11,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:51:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99374971] [2022-07-19 10:51:11,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:11,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:51:11,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:11,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:51:11,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:51:11,305 INFO L87 Difference]: Start difference. First operand 1000 states and 1329 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 10:51:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:11,390 INFO L93 Difference]: Finished difference Result 1038 states and 1377 transitions. [2022-07-19 10:51:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:51:11,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2022-07-19 10:51:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:11,397 INFO L225 Difference]: With dead ends: 1038 [2022-07-19 10:51:11,397 INFO L226 Difference]: Without dead ends: 1034 [2022-07-19 10:51:11,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:51:11,398 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:11,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 820 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-07-19 10:51:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 995. [2022-07-19 10:51:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 906 states have (on average 1.2759381898454747) internal successors, (1156), 919 states have internal predecessors, (1156), 81 states have call successors, (81), 5 states have call predecessors, (81), 7 states have return successors, (84), 75 states have call predecessors, (84), 78 states have call successors, (84) [2022-07-19 10:51:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1321 transitions. [2022-07-19 10:51:11,437 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1321 transitions. Word has length 62 [2022-07-19 10:51:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:11,437 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1321 transitions. [2022-07-19 10:51:11,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 10:51:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1321 transitions. [2022-07-19 10:51:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 10:51:11,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:11,439 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:11,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 10:51:11,439 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:11,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash -282367073, now seen corresponding path program 1 times [2022-07-19 10:51:11,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:11,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11734884] [2022-07-19 10:51:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:11,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 10:51:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 10:51:11,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:11,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11734884] [2022-07-19 10:51:11,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11734884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:11,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:11,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:51:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706484794] [2022-07-19 10:51:11,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:11,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:51:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:11,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:51:11,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:51:11,483 INFO L87 Difference]: Start difference. First operand 995 states and 1321 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 10:51:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:11,576 INFO L93 Difference]: Finished difference Result 1028 states and 1362 transitions. [2022-07-19 10:51:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:51:11,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2022-07-19 10:51:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:11,579 INFO L225 Difference]: With dead ends: 1028 [2022-07-19 10:51:11,579 INFO L226 Difference]: Without dead ends: 1014 [2022-07-19 10:51:11,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:51:11,581 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:11,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 820 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2022-07-19 10:51:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 980. [2022-07-19 10:51:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 894 states have (on average 1.2706935123042506) internal successors, (1136), 905 states have internal predecessors, (1136), 78 states have call successors, (78), 5 states have call predecessors, (78), 7 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-07-19 10:51:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1294 transitions. [2022-07-19 10:51:11,618 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1294 transitions. Word has length 62 [2022-07-19 10:51:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:11,618 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1294 transitions. [2022-07-19 10:51:11,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 10:51:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1294 transitions. [2022-07-19 10:51:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 10:51:11,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:11,621 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:11,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 10:51:11,621 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1649289642, now seen corresponding path program 1 times [2022-07-19 10:51:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:11,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855944814] [2022-07-19 10:51:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:11,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 10:51:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:11,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:11,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855944814] [2022-07-19 10:51:11,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855944814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:11,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848723701] [2022-07-19 10:51:11,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:11,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:11,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:11,740 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:11,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 10:51:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:11,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 10:51:11,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 10:51:11,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:11,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848723701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:11,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:51:11,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-19 10:51:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821674786] [2022-07-19 10:51:11,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:11,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:51:11,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:51:11,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:51:11,907 INFO L87 Difference]: Start difference. First operand 980 states and 1294 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:51:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:12,058 INFO L93 Difference]: Finished difference Result 1229 states and 1635 transitions. [2022-07-19 10:51:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:51:12,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2022-07-19 10:51:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:12,062 INFO L225 Difference]: With dead ends: 1229 [2022-07-19 10:51:12,062 INFO L226 Difference]: Without dead ends: 1213 [2022-07-19 10:51:12,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:51:12,063 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 218 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:12,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 527 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:12,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-07-19 10:51:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 980. [2022-07-19 10:51:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 894 states have (on average 1.2684563758389262) internal successors, (1134), 905 states have internal predecessors, (1134), 78 states have call successors, (78), 5 states have call predecessors, (78), 7 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-07-19 10:51:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1292 transitions. [2022-07-19 10:51:12,099 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1292 transitions. Word has length 62 [2022-07-19 10:51:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:12,100 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1292 transitions. [2022-07-19 10:51:12,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:51:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1292 transitions. [2022-07-19 10:51:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 10:51:12,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:12,101 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, 1, 1, 1, 1, 1] [2022-07-19 10:51:12,121 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-19 10:51:12,315 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,SelfDestructingSolverStorable26 [2022-07-19 10:51:12,315 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:12,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1828096048, now seen corresponding path program 1 times [2022-07-19 10:51:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:12,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839749732] [2022-07-19 10:51:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:12,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:12,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:12,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:12,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:51:12,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:12,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839749732] [2022-07-19 10:51:12,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839749732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:12,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:12,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:51:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441947435] [2022-07-19 10:51:12,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:12,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:51:12,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:12,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:51:12,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:51:12,364 INFO L87 Difference]: Start difference. First operand 980 states and 1292 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:12,575 INFO L93 Difference]: Finished difference Result 1643 states and 2220 transitions. [2022-07-19 10:51:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:51:12,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-07-19 10:51:12,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:12,579 INFO L225 Difference]: With dead ends: 1643 [2022-07-19 10:51:12,579 INFO L226 Difference]: Without dead ends: 1189 [2022-07-19 10:51:12,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:51:12,580 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 211 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:12,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1060 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2022-07-19 10:51:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1055. [2022-07-19 10:51:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 969 states have (on average 1.2445820433436532) internal successors, (1206), 980 states have internal predecessors, (1206), 78 states have call successors, (78), 5 states have call predecessors, (78), 7 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-07-19 10:51:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1364 transitions. [2022-07-19 10:51:12,617 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1364 transitions. Word has length 62 [2022-07-19 10:51:12,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:12,617 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1364 transitions. [2022-07-19 10:51:12,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1364 transitions. [2022-07-19 10:51:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 10:51:12,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:12,619 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, 1, 1, 1, 1, 1] [2022-07-19 10:51:12,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 10:51:12,619 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:12,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1826249006, now seen corresponding path program 1 times [2022-07-19 10:51:12,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:12,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046003846] [2022-07-19 10:51:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:12,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:12,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:12,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:51:12,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:12,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046003846] [2022-07-19 10:51:12,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046003846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:12,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:12,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 10:51:12,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388614438] [2022-07-19 10:51:12,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:12,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:51:12,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:12,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:51:12,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:51:12,765 INFO L87 Difference]: Start difference. First operand 1055 states and 1364 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:13,248 INFO L93 Difference]: Finished difference Result 1118 states and 1440 transitions. [2022-07-19 10:51:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:51:13,248 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2022-07-19 10:51:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:13,251 INFO L225 Difference]: With dead ends: 1118 [2022-07-19 10:51:13,251 INFO L226 Difference]: Without dead ends: 1116 [2022-07-19 10:51:13,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:51:13,252 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 380 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:13,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1998 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:51:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-07-19 10:51:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1065. [2022-07-19 10:51:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 977 states have (on average 1.2425793244626406) internal successors, (1214), 989 states have internal predecessors, (1214), 79 states have call successors, (79), 6 states have call predecessors, (79), 8 states have return successors, (81), 74 states have call predecessors, (81), 75 states have call successors, (81) [2022-07-19 10:51:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1374 transitions. [2022-07-19 10:51:13,289 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1374 transitions. Word has length 62 [2022-07-19 10:51:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:13,289 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1374 transitions. [2022-07-19 10:51:13,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1374 transitions. [2022-07-19 10:51:13,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 10:51:13,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:13,291 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, 1, 1, 1] [2022-07-19 10:51:13,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 10:51:13,300 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:13,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:13,300 INFO L85 PathProgramCache]: Analyzing trace with hash -654456506, now seen corresponding path program 1 times [2022-07-19 10:51:13,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:13,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493898903] [2022-07-19 10:51:13,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:13,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:13,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:13,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:13,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:51:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:13,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:13,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493898903] [2022-07-19 10:51:13,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493898903] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:13,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941454426] [2022-07-19 10:51:13,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:13,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:13,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:13,352 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:13,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 10:51:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:13,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:51:13,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:13,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:13,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941454426] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:13,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:13,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-07-19 10:51:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880651427] [2022-07-19 10:51:13,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:13,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:51:13,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:13,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:51:13,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:51:13,487 INFO L87 Difference]: Start difference. First operand 1065 states and 1374 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:13,781 INFO L93 Difference]: Finished difference Result 3170 states and 4156 transitions. [2022-07-19 10:51:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:51:13,782 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-07-19 10:51:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:13,788 INFO L225 Difference]: With dead ends: 3170 [2022-07-19 10:51:13,788 INFO L226 Difference]: Without dead ends: 2732 [2022-07-19 10:51:13,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:51:13,790 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 286 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:13,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1824 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:51:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2022-07-19 10:51:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 1170. [2022-07-19 10:51:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1080 states have (on average 1.2361111111111112) internal successors, (1335), 1090 states have internal predecessors, (1335), 80 states have call successors, (80), 6 states have call predecessors, (80), 9 states have return successors, (88), 78 states have call predecessors, (88), 76 states have call successors, (88) [2022-07-19 10:51:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1503 transitions. [2022-07-19 10:51:13,846 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1503 transitions. Word has length 65 [2022-07-19 10:51:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:13,846 INFO L495 AbstractCegarLoop]: Abstraction has 1170 states and 1503 transitions. [2022-07-19 10:51:13,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1503 transitions. [2022-07-19 10:51:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 10:51:13,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:13,848 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, 1, 1, 1] [2022-07-19 10:51:13,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:14,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:14,060 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:14,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1951567048, now seen corresponding path program 1 times [2022-07-19 10:51:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:14,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713831323] [2022-07-19 10:51:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:14,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:14,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:51:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:14,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:14,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713831323] [2022-07-19 10:51:14,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713831323] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:14,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698150268] [2022-07-19 10:51:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:14,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:14,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:14,108 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:14,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 10:51:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:14,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 10:51:14,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 10:51:14,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 10:51:14,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698150268] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:14,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:14,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2022-07-19 10:51:14,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277053084] [2022-07-19 10:51:14,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:14,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 10:51:14,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:14,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 10:51:14,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:51:14,364 INFO L87 Difference]: Start difference. First operand 1170 states and 1503 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:51:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:15,119 INFO L93 Difference]: Finished difference Result 3318 states and 4373 transitions. [2022-07-19 10:51:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-19 10:51:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-07-19 10:51:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:15,127 INFO L225 Difference]: With dead ends: 3318 [2022-07-19 10:51:15,127 INFO L226 Difference]: Without dead ends: 2835 [2022-07-19 10:51:15,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1154, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 10:51:15,130 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 610 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:15,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 2300 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:51:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2022-07-19 10:51:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 1230. [2022-07-19 10:51:15,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1138 states have (on average 1.2319859402460458) internal successors, (1402), 1146 states have internal predecessors, (1402), 81 states have call successors, (81), 6 states have call predecessors, (81), 10 states have return successors, (97), 82 states have call predecessors, (97), 77 states have call successors, (97) [2022-07-19 10:51:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1580 transitions. [2022-07-19 10:51:15,189 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1580 transitions. Word has length 65 [2022-07-19 10:51:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:15,189 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1580 transitions. [2022-07-19 10:51:15,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:51:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1580 transitions. [2022-07-19 10:51:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 10:51:15,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:15,191 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, 1, 1, 1] [2022-07-19 10:51:15,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:15,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-19 10:51:15,407 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:15,408 INFO L85 PathProgramCache]: Analyzing trace with hash -520443000, now seen corresponding path program 1 times [2022-07-19 10:51:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:15,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416000304] [2022-07-19 10:51:15,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:15,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:15,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:51:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:15,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416000304] [2022-07-19 10:51:15,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416000304] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:15,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217802407] [2022-07-19 10:51:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:15,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:15,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:15,467 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:15,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 10:51:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:15,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 10:51:15,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:15,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:15,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217802407] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:15,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:15,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-07-19 10:51:15,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651002073] [2022-07-19 10:51:15,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:15,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:51:15,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:15,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:51:15,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:51:15,607 INFO L87 Difference]: Start difference. First operand 1230 states and 1580 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:16,053 INFO L93 Difference]: Finished difference Result 3599 states and 4859 transitions. [2022-07-19 10:51:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:51:16,054 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-07-19 10:51:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:16,062 INFO L225 Difference]: With dead ends: 3599 [2022-07-19 10:51:16,062 INFO L226 Difference]: Without dead ends: 3274 [2022-07-19 10:51:16,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:51:16,064 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 491 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:16,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2439 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:51:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2022-07-19 10:51:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 1356. [2022-07-19 10:51:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1264 states have (on average 1.2231012658227849) internal successors, (1546), 1272 states have internal predecessors, (1546), 81 states have call successors, (81), 6 states have call predecessors, (81), 10 states have return successors, (97), 82 states have call predecessors, (97), 77 states have call successors, (97) [2022-07-19 10:51:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1724 transitions. [2022-07-19 10:51:16,132 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1724 transitions. Word has length 65 [2022-07-19 10:51:16,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:16,132 INFO L495 AbstractCegarLoop]: Abstraction has 1356 states and 1724 transitions. [2022-07-19 10:51:16,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1724 transitions. [2022-07-19 10:51:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 10:51:16,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:16,135 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, 1, 1, 1] [2022-07-19 10:51:16,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:16,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-19 10:51:16,351 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash -915317052, now seen corresponding path program 1 times [2022-07-19 10:51:16,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:16,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236706000] [2022-07-19 10:51:16,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:16,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:16,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:16,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:51:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:16,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:16,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236706000] [2022-07-19 10:51:16,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236706000] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:16,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295714731] [2022-07-19 10:51:16,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:16,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:16,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:16,403 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:16,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 10:51:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:16,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 10:51:16,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 10:51:16,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 10:51:16,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295714731] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:16,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:16,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-07-19 10:51:16,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911599990] [2022-07-19 10:51:16,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:16,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:51:16,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:16,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:51:16,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:51:16,673 INFO L87 Difference]: Start difference. First operand 1356 states and 1724 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:51:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:17,678 INFO L93 Difference]: Finished difference Result 4186 states and 5617 transitions. [2022-07-19 10:51:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 10:51:17,679 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-07-19 10:51:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:17,685 INFO L225 Difference]: With dead ends: 4186 [2022-07-19 10:51:17,685 INFO L226 Difference]: Without dead ends: 3598 [2022-07-19 10:51:17,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=1522, Unknown=0, NotChecked=0, Total=1806 [2022-07-19 10:51:17,689 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 948 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:17,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 2562 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:51:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2022-07-19 10:51:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 1272. [2022-07-19 10:51:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1181 states have (on average 1.2277730736663843) internal successors, (1450), 1192 states have internal predecessors, (1450), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (91), 78 states have call predecessors, (91), 76 states have call successors, (91) [2022-07-19 10:51:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1621 transitions. [2022-07-19 10:51:17,748 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1621 transitions. Word has length 65 [2022-07-19 10:51:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:17,749 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1621 transitions. [2022-07-19 10:51:17,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:51:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1621 transitions. [2022-07-19 10:51:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 10:51:17,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:17,751 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, 1, 1, 1] [2022-07-19 10:51:17,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:17,967 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,SelfDestructingSolverStorable32 [2022-07-19 10:51:17,968 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:17,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1548806121, now seen corresponding path program 1 times [2022-07-19 10:51:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:17,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49011800] [2022-07-19 10:51:17,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:17,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:17,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:17,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:18,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:51:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:18,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:18,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49011800] [2022-07-19 10:51:18,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49011800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:18,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192088007] [2022-07-19 10:51:18,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:18,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:18,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:18,018 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:18,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 10:51:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:18,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 10:51:18,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:51:18,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:18,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192088007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:18,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:51:18,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-19 10:51:18,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881516088] [2022-07-19 10:51:18,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:18,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:18,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:51:18,086 INFO L87 Difference]: Start difference. First operand 1272 states and 1621 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:18,175 INFO L93 Difference]: Finished difference Result 2435 states and 3135 transitions. [2022-07-19 10:51:18,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:51:18,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-07-19 10:51:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:18,178 INFO L225 Difference]: With dead ends: 2435 [2022-07-19 10:51:18,178 INFO L226 Difference]: Without dead ends: 1306 [2022-07-19 10:51:18,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:51:18,181 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 27 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:18,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 385 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2022-07-19 10:51:18,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1281. [2022-07-19 10:51:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1190 states have (on average 1.2285714285714286) internal successors, (1462), 1201 states have internal predecessors, (1462), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (91), 78 states have call predecessors, (91), 76 states have call successors, (91) [2022-07-19 10:51:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1633 transitions. [2022-07-19 10:51:18,248 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1633 transitions. Word has length 65 [2022-07-19 10:51:18,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:18,248 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1633 transitions. [2022-07-19 10:51:18,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1633 transitions. [2022-07-19 10:51:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 10:51:18,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:18,251 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, 1, 1, 1] [2022-07-19 10:51:18,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:18,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:18,463 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:18,464 INFO L85 PathProgramCache]: Analyzing trace with hash -267248656, now seen corresponding path program 2 times [2022-07-19 10:51:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:18,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778341951] [2022-07-19 10:51:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:18,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:18,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:18,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:18,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:18,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778341951] [2022-07-19 10:51:18,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778341951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:18,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:18,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 10:51:18,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652294766] [2022-07-19 10:51:18,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:18,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:51:18,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:18,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:51:18,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:51:18,520 INFO L87 Difference]: Start difference. First operand 1281 states and 1633 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:18,847 INFO L93 Difference]: Finished difference Result 2456 states and 3239 transitions. [2022-07-19 10:51:18,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:51:18,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2022-07-19 10:51:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:18,851 INFO L225 Difference]: With dead ends: 2456 [2022-07-19 10:51:18,851 INFO L226 Difference]: Without dead ends: 2247 [2022-07-19 10:51:18,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:51:18,852 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 319 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:18,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1798 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:51:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2022-07-19 10:51:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1434. [2022-07-19 10:51:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1343 states have (on average 1.2204020848845867) internal successors, (1639), 1351 states have internal predecessors, (1639), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (91), 81 states have call predecessors, (91), 76 states have call successors, (91) [2022-07-19 10:51:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1810 transitions. [2022-07-19 10:51:18,907 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1810 transitions. Word has length 65 [2022-07-19 10:51:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:18,908 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1810 transitions. [2022-07-19 10:51:18,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1810 transitions. [2022-07-19 10:51:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 10:51:18,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:18,910 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, 1, 1, 1] [2022-07-19 10:51:18,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-19 10:51:18,910 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:18,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:18,910 INFO L85 PathProgramCache]: Analyzing trace with hash -662122708, now seen corresponding path program 1 times [2022-07-19 10:51:18,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:18,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504814916] [2022-07-19 10:51:18,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:18,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:18,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:18,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:18,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504814916] [2022-07-19 10:51:18,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504814916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:18,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:18,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:51:18,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306712675] [2022-07-19 10:51:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:18,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:51:18,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:18,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:51:18,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:51:18,958 INFO L87 Difference]: Start difference. First operand 1434 states and 1810 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:19,257 INFO L93 Difference]: Finished difference Result 2768 states and 3629 transitions. [2022-07-19 10:51:19,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:51:19,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2022-07-19 10:51:19,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:19,260 INFO L225 Difference]: With dead ends: 2768 [2022-07-19 10:51:19,260 INFO L226 Difference]: Without dead ends: 2306 [2022-07-19 10:51:19,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:51:19,262 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 312 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:19,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 942 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2022-07-19 10:51:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1432. [2022-07-19 10:51:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1341 states have (on average 1.2192393736017897) internal successors, (1635), 1347 states have internal predecessors, (1635), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (90), 83 states have call predecessors, (90), 76 states have call successors, (90) [2022-07-19 10:51:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1805 transitions. [2022-07-19 10:51:19,321 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1805 transitions. Word has length 65 [2022-07-19 10:51:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:19,321 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1805 transitions. [2022-07-19 10:51:19,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1805 transitions. [2022-07-19 10:51:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-19 10:51:19,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:19,323 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, 1, 1, 1, 1] [2022-07-19 10:51:19,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-19 10:51:19,324 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash -560142362, now seen corresponding path program 1 times [2022-07-19 10:51:19,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:19,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26432698] [2022-07-19 10:51:19,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:19,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:19,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:19,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 10:51:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:51:19,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:19,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26432698] [2022-07-19 10:51:19,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26432698] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:19,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312061520] [2022-07-19 10:51:19,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:19,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:19,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:19,348 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:19,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 10:51:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:19,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 10:51:19,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:51:19,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:19,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312061520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:19,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:51:19,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-19 10:51:19,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945993560] [2022-07-19 10:51:19,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:19,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:19,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:19,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:19,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:19,411 INFO L87 Difference]: Start difference. First operand 1432 states and 1805 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:19,479 INFO L93 Difference]: Finished difference Result 2428 states and 3070 transitions. [2022-07-19 10:51:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:51:19,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-07-19 10:51:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:19,482 INFO L225 Difference]: With dead ends: 2428 [2022-07-19 10:51:19,482 INFO L226 Difference]: Without dead ends: 1443 [2022-07-19 10:51:19,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:51:19,484 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 14 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:19,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 410 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:19,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2022-07-19 10:51:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1433. [2022-07-19 10:51:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1342 states have (on average 1.2198211624441133) internal successors, (1637), 1348 states have internal predecessors, (1637), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (90), 83 states have call predecessors, (90), 76 states have call successors, (90) [2022-07-19 10:51:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1807 transitions. [2022-07-19 10:51:19,538 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1807 transitions. Word has length 66 [2022-07-19 10:51:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:19,538 INFO L495 AbstractCegarLoop]: Abstraction has 1433 states and 1807 transitions. [2022-07-19 10:51:19,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1807 transitions. [2022-07-19 10:51:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 10:51:19,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:19,540 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, 1, 1, 1, 1, 1] [2022-07-19 10:51:19,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:19,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-19 10:51:19,752 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1378433375, now seen corresponding path program 1 times [2022-07-19 10:51:19,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:19,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523075752] [2022-07-19 10:51:19,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:19,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:51:19,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 10:51:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:51:19,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 10:51:19,821 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 10:51:19,822 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:51:19,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-19 10:51:19,826 INFO L356 BasicCegarLoop]: Path program histogram: [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] [2022-07-19 10:51:19,828 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:51:19,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:51:19 BoogieIcfgContainer [2022-07-19 10:51:19,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:51:19,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:51:19,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:51:19,884 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:51:19,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:51:01" (3/4) ... [2022-07-19 10:51:19,886 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 10:51:19,886 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:51:19,887 INFO L158 Benchmark]: Toolchain (without parser) took 19585.64ms. Allocated memory was 94.4MB in the beginning and 285.2MB in the end (delta: 190.8MB). Free memory was 60.6MB in the beginning and 180.4MB in the end (delta: -119.8MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2022-07-19 10:51:19,897 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory was 63.8MB in the beginning and 63.7MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:51:19,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.65ms. Allocated memory is still 94.4MB. Free memory was 60.4MB in the beginning and 67.2MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 10:51:19,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.45ms. Allocated memory is still 94.4MB. Free memory was 67.2MB in the beginning and 64.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:51:19,899 INFO L158 Benchmark]: Boogie Preprocessor took 39.22ms. Allocated memory is still 94.4MB. Free memory was 64.9MB in the beginning and 63.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:51:19,900 INFO L158 Benchmark]: RCFGBuilder took 484.04ms. Allocated memory is still 94.4MB. Free memory was 63.0MB in the beginning and 43.5MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-19 10:51:19,900 INFO L158 Benchmark]: TraceAbstraction took 18668.15ms. Allocated memory was 94.4MB in the beginning and 285.2MB in the end (delta: 190.8MB). Free memory was 42.5MB in the beginning and 181.4MB in the end (delta: -138.9MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. [2022-07-19 10:51:19,900 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 285.2MB. Free memory was 181.4MB in the beginning and 180.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:51:19,901 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.15ms. Allocated memory is still 94.4MB. Free memory was 63.8MB in the beginning and 63.7MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.65ms. Allocated memory is still 94.4MB. Free memory was 60.4MB in the beginning and 67.2MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.45ms. Allocated memory is still 94.4MB. Free memory was 67.2MB in the beginning and 64.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.22ms. Allocated memory is still 94.4MB. Free memory was 64.9MB in the beginning and 63.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 484.04ms. Allocated memory is still 94.4MB. Free memory was 63.0MB in the beginning and 43.5MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18668.15ms. Allocated memory was 94.4MB in the beginning and 285.2MB in the end (delta: 190.8MB). Free memory was 42.5MB in the beginning and 181.4MB in the end (delta: -138.9MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 285.2MB. Free memory was 181.4MB in the beginning and 180.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=-125, eb=127] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L251] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L29] COND FALSE !(! m) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L57] COND TRUE 1 VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res=4294967295, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L78] __retres4 = res VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, __retres4=4294967295, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res=4294967295, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, \result=144115188075855871, __retres4=4294967295, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res=4294967295, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L252] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=144115188075855871, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, m = m & ~ (1U << 24U)=144115188075855872, 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))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, 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))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, \result=4294967295, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L253] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, tmp=1, zero=0] [L263] sa = tmp VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [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)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L94] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L101] COND FALSE !(! b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855872, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L110] ma = ma | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L111] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L113] mb = mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, mb=2, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0, m = m & ~ (1U << 24U)=144115188075855872, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=144115188075855872, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L17] reach_error() VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=144115188075855872, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.6s, OverallIterations: 38, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8057 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7863 mSDsluCounter, 42220 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35138 mSDsCounter, 955 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9268 IncrementalHoareTripleChecker+Invalid, 10223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 955 mSolverCounterUnsat, 7082 mSDtfsCounter, 9268 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2105 GetRequests, 1621 SyntacticMatches, 15 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1434occurred in iteration=35, InterpolantAutomatonStates: 362, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 12764 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2922 NumberOfCodeBlocks, 2922 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 3364 ConstructedInterpolants, 0 QuantifiedInterpolants, 9323 SizeOfPredicates, 88 NumberOfNonLiveVariables, 2664 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 62 InterpolantComputations, 29 PerfectInterpolantSequences, 916/1054 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-19 10:51:19,921 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_1-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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:51:21,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:51:21,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:51:21,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:51:21,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:51:21,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:51:21,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:51:21,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:51:21,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:51:21,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:51:21,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:51:21,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:51:21,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:51:21,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:51:21,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:51:21,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:51:21,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:51:21,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:51:21,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:51:21,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:51:21,611 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:51:21,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:51:21,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:51:21,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:51:21,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:51:21,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:51:21,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:51:21,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:51:21,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:51:21,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:51:21,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:51:21,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:51:21,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:51:21,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:51:21,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:51:21,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:51:21,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:51:21,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:51:21,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:51:21,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:51:21,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:51:21,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:51:21,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 10:51:21,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:51:21,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:51:21,648 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:51:21,648 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:51:21,649 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:51:21,649 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:51:21,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:51:21,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:51:21,650 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:51:21,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:51:21,650 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:51:21,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:51:21,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:51:21,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:51:21,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:51:21,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:51:21,655 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 10:51:21,655 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 10:51:21,655 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 10:51:21,655 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:51:21,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:51:21,655 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:51:21,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:51:21,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:51:21,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:51:21,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:51:21,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:51:21,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:51:21,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:51:21,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:51:21,656 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 10:51:21,657 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 10:51:21,657 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:51:21,657 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:51:21,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:51:21,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 10:51:21,657 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2022-07-19 10:51:21,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:51:21,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:51:21,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:51:21,922 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:51:21,923 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:51:21,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-19 10:51:21,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf4a8583/a1c434e87ca645e9abdcdbafae3f69b0/FLAGcedda5916 [2022-07-19 10:51:22,309 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:51:22,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-19 10:51:22,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf4a8583/a1c434e87ca645e9abdcdbafae3f69b0/FLAGcedda5916 [2022-07-19 10:51:22,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf4a8583/a1c434e87ca645e9abdcdbafae3f69b0 [2022-07-19 10:51:22,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:51:22,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:51:22,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:51:22,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:51:22,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:51:22,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:51:22" (1/1) ... [2022-07-19 10:51:22,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e9b525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22, skipping insertion in model container [2022-07-19 10:51:22,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:51:22" (1/1) ... [2022-07-19 10:51:22,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:51:22,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:51:22,819 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_1-3a.c.cil.c[730,743] [2022-07-19 10:51:22,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:51:22,898 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:51:22,907 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_1-3a.c.cil.c[730,743] [2022-07-19 10:51:22,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:51:22,963 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:51:22,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22 WrapperNode [2022-07-19 10:51:22,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:51:22,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:51:22,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:51:22,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:51:22,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22" (1/1) ... [2022-07-19 10:51:22,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22" (1/1) ... [2022-07-19 10:51:23,008 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 145 [2022-07-19 10:51:23,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:51:23,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:51:23,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:51:23,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:51:23,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22" (1/1) ... [2022-07-19 10:51:23,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22" (1/1) ... [2022-07-19 10:51:23,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22" (1/1) ... [2022-07-19 10:51:23,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22" (1/1) ... [2022-07-19 10:51:23,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22" (1/1) ... [2022-07-19 10:51:23,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22" (1/1) ... [2022-07-19 10:51:23,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22" (1/1) ... [2022-07-19 10:51:23,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:51:23,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:51:23,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:51:23,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:51:23,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22" (1/1) ... [2022-07-19 10:51:23,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:51:23,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:23,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:51:23,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:51:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:51:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 10:51:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-19 10:51:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-19 10:51:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:51:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:51:23,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 10:51:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 10:51:23,161 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:51:23,162 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:51:23,399 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:51:23,403 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:51:23,404 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 10:51:23,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:51:23 BoogieIcfgContainer [2022-07-19 10:51:23,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:51:23,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:51:23,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:51:23,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:51:23,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:51:22" (1/3) ... [2022-07-19 10:51:23,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74689dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:51:23, skipping insertion in model container [2022-07-19 10:51:23,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:22" (2/3) ... [2022-07-19 10:51:23,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74689dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:51:23, skipping insertion in model container [2022-07-19 10:51:23,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:51:23" (3/3) ... [2022-07-19 10:51:23,410 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2022-07-19 10:51:23,420 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:51:23,420 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:51:23,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:51:23,476 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@55b9ef37, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@670f4a6d [2022-07-19 10:51:23,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:51:23,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 62 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-19 10:51:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:51:23,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:23,492 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] [2022-07-19 10:51:23,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:23,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:23,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1607439287, now seen corresponding path program 1 times [2022-07-19 10:51:23,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:23,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244105206] [2022-07-19 10:51:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:23,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:23,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:23,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:23,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 10:51:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:23,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 10:51:23,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:23,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:23,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:23,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244105206] [2022-07-19 10:51:23,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244105206] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:23,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:51:23,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-19 10:51:23,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299741315] [2022-07-19 10:51:23,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:23,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:51:23,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:23,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:51:23,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:51:23,745 INFO L87 Difference]: Start difference. First operand has 72 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 62 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:23,853 INFO L93 Difference]: Finished difference Result 194 states and 324 transitions. [2022-07-19 10:51:23,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:51:23,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-07-19 10:51:23,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:23,861 INFO L225 Difference]: With dead ends: 194 [2022-07-19 10:51:23,862 INFO L226 Difference]: Without dead ends: 117 [2022-07-19 10:51:23,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:51:23,866 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 61 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:23,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 738 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-19 10:51:23,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 80. [2022-07-19 10:51:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 67 states have internal predecessors, (95), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-19 10:51:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2022-07-19 10:51:23,900 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 32 [2022-07-19 10:51:23,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:23,900 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2022-07-19 10:51:23,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2022-07-19 10:51:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 10:51:23,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:23,902 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] [2022-07-19 10:51:23,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-19 10:51:24,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:24,107 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:24,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash 861184615, now seen corresponding path program 1 times [2022-07-19 10:51:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:24,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758879112] [2022-07-19 10:51:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:24,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:24,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:24,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:24,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 10:51:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:24,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 10:51:24,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:24,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:24,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:24,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:24,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758879112] [2022-07-19 10:51:24,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758879112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:24,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:24,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:51:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138974881] [2022-07-19 10:51:24,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:24,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:51:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:24,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:51:24,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:51:24,215 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:24,316 INFO L93 Difference]: Finished difference Result 169 states and 260 transitions. [2022-07-19 10:51:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:51:24,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-19 10:51:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:24,319 INFO L225 Difference]: With dead ends: 169 [2022-07-19 10:51:24,319 INFO L226 Difference]: Without dead ends: 127 [2022-07-19 10:51:24,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:51:24,321 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 52 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:24,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 457 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-19 10:51:24,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2022-07-19 10:51:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.4660194174757282) internal successors, (151), 104 states have internal predecessors, (151), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (20), 18 states have call predecessors, (20), 15 states have call successors, (20) [2022-07-19 10:51:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 187 transitions. [2022-07-19 10:51:24,347 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 187 transitions. Word has length 36 [2022-07-19 10:51:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:24,347 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 187 transitions. [2022-07-19 10:51:24,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 187 transitions. [2022-07-19 10:51:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 10:51:24,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:24,354 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] [2022-07-19 10:51:24,362 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-19 10:51:24,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:24,559 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1541242985, now seen corresponding path program 1 times [2022-07-19 10:51:24,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:24,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406721332] [2022-07-19 10:51:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:24,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:24,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:24,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 10:51:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:24,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 10:51:24,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:24,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:24,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:24,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406721332] [2022-07-19 10:51:24,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406721332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:24,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:24,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:51:24,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394947044] [2022-07-19 10:51:24,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:24,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:51:24,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:24,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:51:24,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:51:24,644 INFO L87 Difference]: Start difference. First operand 123 states and 187 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:24,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:24,749 INFO L93 Difference]: Finished difference Result 180 states and 274 transitions. [2022-07-19 10:51:24,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:51:24,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-19 10:51:24,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:24,752 INFO L225 Difference]: With dead ends: 180 [2022-07-19 10:51:24,752 INFO L226 Difference]: Without dead ends: 141 [2022-07-19 10:51:24,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:51:24,753 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 105 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:24,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 539 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-19 10:51:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2022-07-19 10:51:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-19 10:51:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 170 transitions. [2022-07-19 10:51:24,762 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 170 transitions. Word has length 36 [2022-07-19 10:51:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:24,762 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 170 transitions. [2022-07-19 10:51:24,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 170 transitions. [2022-07-19 10:51:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 10:51:24,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:24,764 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] [2022-07-19 10:51:24,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:24,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:24,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:24,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1860643154, now seen corresponding path program 1 times [2022-07-19 10:51:24,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:24,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953193993] [2022-07-19 10:51:24,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:24,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:24,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:24,973 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:24,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 10:51:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:25,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:51:25,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:25,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:25,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:25,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953193993] [2022-07-19 10:51:25,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953193993] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:25,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:51:25,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-19 10:51:25,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470737457] [2022-07-19 10:51:25,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:25,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:51:25,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:25,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:51:25,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:51:25,117 INFO L87 Difference]: Start difference. First operand 114 states and 170 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:25,255 INFO L93 Difference]: Finished difference Result 312 states and 476 transitions. [2022-07-19 10:51:25,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:51:25,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2022-07-19 10:51:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:25,258 INFO L225 Difference]: With dead ends: 312 [2022-07-19 10:51:25,258 INFO L226 Difference]: Without dead ends: 237 [2022-07-19 10:51:25,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:51:25,260 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 197 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:25,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 645 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-19 10:51:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 178. [2022-07-19 10:51:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 154 states have internal predecessors, (215), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (25), 25 states have call predecessors, (25), 18 states have call successors, (25) [2022-07-19 10:51:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2022-07-19 10:51:25,270 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 40 [2022-07-19 10:51:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:25,271 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2022-07-19 10:51:25,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2022-07-19 10:51:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 10:51:25,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:25,281 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:25,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:25,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:25,488 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash 339137576, now seen corresponding path program 1 times [2022-07-19 10:51:25,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:25,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913888597] [2022-07-19 10:51:25,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:25,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:25,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:25,491 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:25,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 10:51:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:25,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:51:25,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:25,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:25,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:25,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913888597] [2022-07-19 10:51:25,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913888597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:25,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:25,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:25,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403837893] [2022-07-19 10:51:25,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:25,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:25,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:25,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:25,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:25,558 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:25,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:25,585 INFO L93 Difference]: Finished difference Result 331 states and 489 transitions. [2022-07-19 10:51:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:51:25,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-19 10:51:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:25,587 INFO L225 Difference]: With dead ends: 331 [2022-07-19 10:51:25,587 INFO L226 Difference]: Without dead ends: 265 [2022-07-19 10:51:25,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:25,588 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 66 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:25,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 344 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-19 10:51:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 233. [2022-07-19 10:51:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 207 states have (on average 1.3478260869565217) internal successors, (279), 206 states have internal predecessors, (279), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2022-07-19 10:51:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 329 transitions. [2022-07-19 10:51:25,613 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 329 transitions. Word has length 43 [2022-07-19 10:51:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:25,614 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 329 transitions. [2022-07-19 10:51:25,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 329 transitions. [2022-07-19 10:51:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 10:51:25,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:25,615 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] [2022-07-19 10:51:25,625 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-19 10:51:25,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:25,818 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1682069059, now seen corresponding path program 1 times [2022-07-19 10:51:25,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:25,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318761236] [2022-07-19 10:51:25,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:25,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:25,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:25,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:25,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 10:51:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:25,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:51:25,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:51:25,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:25,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:25,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318761236] [2022-07-19 10:51:25,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318761236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:25,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:25,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933413849] [2022-07-19 10:51:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:25,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:25,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:25,894 INFO L87 Difference]: Start difference. First operand 233 states and 329 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:25,944 INFO L93 Difference]: Finished difference Result 408 states and 573 transitions. [2022-07-19 10:51:25,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:51:25,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2022-07-19 10:51:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:25,947 INFO L225 Difference]: With dead ends: 408 [2022-07-19 10:51:25,947 INFO L226 Difference]: Without dead ends: 178 [2022-07-19 10:51:25,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:25,952 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 25 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:25,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 250 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:25,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-19 10:51:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2022-07-19 10:51:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 148 states have internal predecessors, (191), 15 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-19 10:51:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2022-07-19 10:51:25,968 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 43 [2022-07-19 10:51:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:25,968 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2022-07-19 10:51:25,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:51:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2022-07-19 10:51:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:51:25,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:25,969 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] [2022-07-19 10:51:25,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:26,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:26,180 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash -690232792, now seen corresponding path program 1 times [2022-07-19 10:51:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:26,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062549495] [2022-07-19 10:51:26,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:26,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:26,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:26,181 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:26,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 10:51:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:26,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:51:26,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:26,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:26,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:26,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062549495] [2022-07-19 10:51:26,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062549495] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:26,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:51:26,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-19 10:51:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557186931] [2022-07-19 10:51:26,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:26,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:51:26,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:26,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:51:26,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:51:26,412 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:26,687 INFO L93 Difference]: Finished difference Result 316 states and 459 transitions. [2022-07-19 10:51:26,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:51:26,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-19 10:51:26,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:26,689 INFO L225 Difference]: With dead ends: 316 [2022-07-19 10:51:26,689 INFO L226 Difference]: Without dead ends: 280 [2022-07-19 10:51:26,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:51:26,690 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 193 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:26,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 502 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:51:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-19 10:51:26,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 204. [2022-07-19 10:51:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 178 states have (on average 1.303370786516854) internal successors, (232), 181 states have internal predecessors, (232), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-19 10:51:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 279 transitions. [2022-07-19 10:51:26,699 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 279 transitions. Word has length 44 [2022-07-19 10:51:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:26,699 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 279 transitions. [2022-07-19 10:51:26,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 279 transitions. [2022-07-19 10:51:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:51:26,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:26,700 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] [2022-07-19 10:51:26,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:26,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:26,907 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:26,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1084774570, now seen corresponding path program 1 times [2022-07-19 10:51:26,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:26,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015293734] [2022-07-19 10:51:26,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:26,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:26,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:26,909 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:26,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 10:51:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:26,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 10:51:26,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:26,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:26,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:26,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015293734] [2022-07-19 10:51:26,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015293734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:26,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:26,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:51:26,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977380813] [2022-07-19 10:51:26,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:26,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:51:26,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:26,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:51:26,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:26,963 INFO L87 Difference]: Start difference. First operand 204 states and 279 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:26,983 INFO L93 Difference]: Finished difference Result 211 states and 285 transitions. [2022-07-19 10:51:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:51:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-19 10:51:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:26,985 INFO L225 Difference]: With dead ends: 211 [2022-07-19 10:51:26,985 INFO L226 Difference]: Without dead ends: 204 [2022-07-19 10:51:26,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:51:26,986 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 5 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:26,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 380 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-19 10:51:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-07-19 10:51:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 178 states have (on average 1.2865168539325842) internal successors, (229), 181 states have internal predecessors, (229), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-19 10:51:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 276 transitions. [2022-07-19 10:51:26,992 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 276 transitions. Word has length 44 [2022-07-19 10:51:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:26,992 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 276 transitions. [2022-07-19 10:51:26,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2022-07-19 10:51:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:51:26,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:26,993 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] [2022-07-19 10:51:27,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:27,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:27,201 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:27,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1077808761, now seen corresponding path program 2 times [2022-07-19 10:51:27,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:27,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330361412] [2022-07-19 10:51:27,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:51:27,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:27,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:27,203 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:27,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 10:51:27,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 10:51:27,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:51:27,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:51:27,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:51:27,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:27,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:27,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330361412] [2022-07-19 10:51:27,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330361412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:27,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:27,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:51:27,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896756371] [2022-07-19 10:51:27,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:27,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:51:27,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:27,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:51:27,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:51:27,335 INFO L87 Difference]: Start difference. First operand 204 states and 276 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:27,387 INFO L93 Difference]: Finished difference Result 247 states and 337 transitions. [2022-07-19 10:51:27,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:51:27,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-19 10:51:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:27,388 INFO L225 Difference]: With dead ends: 247 [2022-07-19 10:51:27,388 INFO L226 Difference]: Without dead ends: 245 [2022-07-19 10:51:27,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:51:27,389 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 38 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:27,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 597 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-07-19 10:51:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-19 10:51:27,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 208. [2022-07-19 10:51:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.281767955801105) internal successors, (232), 184 states have internal predecessors, (232), 21 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-19 10:51:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 279 transitions. [2022-07-19 10:51:27,406 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 279 transitions. Word has length 44 [2022-07-19 10:51:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:27,406 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 279 transitions. [2022-07-19 10:51:27,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 279 transitions. [2022-07-19 10:51:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:51:27,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:27,407 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] [2022-07-19 10:51:27,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:27,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:27,614 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:27,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:27,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1020550459, now seen corresponding path program 1 times [2022-07-19 10:51:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:27,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188593053] [2022-07-19 10:51:27,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:27,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:27,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:27,616 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:27,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-19 10:51:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:27,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 10:51:27,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:51:27,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:51:27,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:27,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188593053] [2022-07-19 10:51:27,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188593053] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:27,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:51:27,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2022-07-19 10:51:27,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454506699] [2022-07-19 10:51:27,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:27,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:51:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:27,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:51:27,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:51:27,868 INFO L87 Difference]: Start difference. First operand 208 states and 279 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:27,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:27,978 INFO L93 Difference]: Finished difference Result 265 states and 359 transitions. [2022-07-19 10:51:27,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:51:27,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-19 10:51:27,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:27,980 INFO L225 Difference]: With dead ends: 265 [2022-07-19 10:51:27,980 INFO L226 Difference]: Without dead ends: 263 [2022-07-19 10:51:27,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:51:27,981 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 84 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:27,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 508 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-19 10:51:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 212. [2022-07-19 10:51:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 187 states have internal predecessors, (235), 21 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-19 10:51:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 282 transitions. [2022-07-19 10:51:27,991 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 282 transitions. Word has length 44 [2022-07-19 10:51:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:27,992 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 282 transitions. [2022-07-19 10:51:27,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 282 transitions. [2022-07-19 10:51:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:51:27,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:27,993 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] [2022-07-19 10:51:27,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:28,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:28,199 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:28,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1134786859, now seen corresponding path program 1 times [2022-07-19 10:51:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:28,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677341846] [2022-07-19 10:51:28,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:28,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:28,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:28,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:28,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-19 10:51:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:28,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:51:28,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:28,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:28,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:28,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677341846] [2022-07-19 10:51:28,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677341846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:28,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:28,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:28,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428136646] [2022-07-19 10:51:28,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:28,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:28,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:28,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:28,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:28,258 INFO L87 Difference]: Start difference. First operand 212 states and 282 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:28,290 INFO L93 Difference]: Finished difference Result 351 states and 481 transitions. [2022-07-19 10:51:28,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:51:28,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-19 10:51:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:28,292 INFO L225 Difference]: With dead ends: 351 [2022-07-19 10:51:28,293 INFO L226 Difference]: Without dead ends: 299 [2022-07-19 10:51:28,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:28,293 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 75 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:28,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 309 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-19 10:51:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 231. [2022-07-19 10:51:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 200 states have (on average 1.285) internal successors, (257), 202 states have internal predecessors, (257), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2022-07-19 10:51:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 310 transitions. [2022-07-19 10:51:28,308 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 310 transitions. Word has length 45 [2022-07-19 10:51:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:28,309 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 310 transitions. [2022-07-19 10:51:28,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 310 transitions. [2022-07-19 10:51:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:51:28,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:28,310 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, 1, 1] [2022-07-19 10:51:28,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:28,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:28,516 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash 702695573, now seen corresponding path program 1 times [2022-07-19 10:51:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:28,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672365910] [2022-07-19 10:51:28,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:28,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:28,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:28,518 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:28,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-19 10:51:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:28,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:51:28,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:28,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:28,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:28,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672365910] [2022-07-19 10:51:28,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672365910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:28,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:28,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:28,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360936377] [2022-07-19 10:51:28,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:28,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:28,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:28,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:28,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:28,581 INFO L87 Difference]: Start difference. First operand 231 states and 310 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:28,597 INFO L93 Difference]: Finished difference Result 246 states and 326 transitions. [2022-07-19 10:51:28,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:51:28,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-07-19 10:51:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:28,599 INFO L225 Difference]: With dead ends: 246 [2022-07-19 10:51:28,599 INFO L226 Difference]: Without dead ends: 207 [2022-07-19 10:51:28,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:28,600 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:28,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-19 10:51:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-19 10:51:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.3011363636363635) internal successors, (229), 179 states have internal predecessors, (229), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2022-07-19 10:51:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 280 transitions. [2022-07-19 10:51:28,610 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 280 transitions. Word has length 48 [2022-07-19 10:51:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:28,610 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 280 transitions. [2022-07-19 10:51:28,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 280 transitions. [2022-07-19 10:51:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:51:28,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:28,611 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:28,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:28,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:28,817 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:28,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1948634931, now seen corresponding path program 1 times [2022-07-19 10:51:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:28,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507286021] [2022-07-19 10:51:28,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:28,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:28,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:28,819 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:28,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-19 10:51:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:28,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:51:28,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:28,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:51:28,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:28,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507286021] [2022-07-19 10:51:28,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507286021] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:28,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:51:28,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-07-19 10:51:28,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591544172] [2022-07-19 10:51:28,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:28,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:51:28,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:28,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:51:28,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:51:28,975 INFO L87 Difference]: Start difference. First operand 207 states and 280 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:51:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:29,108 INFO L93 Difference]: Finished difference Result 298 states and 396 transitions. [2022-07-19 10:51:29,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:51:29,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-07-19 10:51:29,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:29,110 INFO L225 Difference]: With dead ends: 298 [2022-07-19 10:51:29,110 INFO L226 Difference]: Without dead ends: 232 [2022-07-19 10:51:29,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:51:29,111 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 174 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:29,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 634 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-19 10:51:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 166. [2022-07-19 10:51:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 143 states have internal predecessors, (184), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (22), 20 states have call predecessors, (22), 18 states have call successors, (22) [2022-07-19 10:51:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2022-07-19 10:51:29,120 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 50 [2022-07-19 10:51:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:29,120 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2022-07-19 10:51:29,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:51:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2022-07-19 10:51:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 10:51:29,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:29,121 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] [2022-07-19 10:51:29,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:29,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:29,328 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:29,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1060673824, now seen corresponding path program 1 times [2022-07-19 10:51:29,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:29,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444835834] [2022-07-19 10:51:29,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:29,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:29,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:29,330 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:29,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-19 10:51:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:29,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:51:29,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:51:29,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:51:29,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:51:29,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444835834] [2022-07-19 10:51:29,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444835834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:29,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:29,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:51:29,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169948632] [2022-07-19 10:51:29,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:29,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:51:29,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:51:29,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:51:29,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:29,402 INFO L87 Difference]: Start difference. First operand 166 states and 225 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:29,463 INFO L93 Difference]: Finished difference Result 241 states and 330 transitions. [2022-07-19 10:51:29,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:51:29,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2022-07-19 10:51:29,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:29,465 INFO L225 Difference]: With dead ends: 241 [2022-07-19 10:51:29,465 INFO L226 Difference]: Without dead ends: 199 [2022-07-19 10:51:29,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:51:29,465 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 128 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:29,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 345 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-19 10:51:29,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 166. [2022-07-19 10:51:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3) internal successors, (182), 143 states have internal predecessors, (182), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (22), 20 states have call predecessors, (22), 18 states have call successors, (22) [2022-07-19 10:51:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 223 transitions. [2022-07-19 10:51:29,481 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 223 transitions. Word has length 49 [2022-07-19 10:51:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:29,481 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 223 transitions. [2022-07-19 10:51:29,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 223 transitions. [2022-07-19 10:51:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:51:29,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:29,482 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:29,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:29,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:29,687 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:29,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:29,687 INFO L85 PathProgramCache]: Analyzing trace with hash 45509775, now seen corresponding path program 1 times [2022-07-19 10:51:29,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:51:29,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647026841] [2022-07-19 10:51:29,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:29,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:51:29,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:51:29,689 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:51:29,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-19 10:51:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:51:29,722 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 10:51:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:51:29,787 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-19 10:51:29,787 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 10:51:29,788 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:51:29,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:29,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:51:29,992 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:29,994 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:51:30,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:51:30 BoogieIcfgContainer [2022-07-19 10:51:30,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:51:30,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:51:30,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:51:30,026 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:51:30,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:51:23" (3/4) ... [2022-07-19 10:51:30,027 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 10:51:30,060 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 10:51:30,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:51:30,061 INFO L158 Benchmark]: Toolchain (without parser) took 7348.20ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 35.2MB in the beginning and 45.1MB in the end (delta: -9.9MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2022-07-19 10:51:30,061 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 38.4MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:51:30,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.65ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.0MB in the beginning and 50.7MB in the end (delta: -15.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 10:51:30,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.02ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 48.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:51:30,062 INFO L158 Benchmark]: Boogie Preprocessor took 42.85ms. Allocated memory is still 69.2MB. Free memory was 48.6MB in the beginning and 47.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:51:30,062 INFO L158 Benchmark]: RCFGBuilder took 352.43ms. Allocated memory is still 69.2MB. Free memory was 47.1MB in the beginning and 49.5MB in the end (delta: -2.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-07-19 10:51:30,062 INFO L158 Benchmark]: TraceAbstraction took 6618.92ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 48.9MB in the beginning and 49.3MB in the end (delta: -369.4kB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2022-07-19 10:51:30,063 INFO L158 Benchmark]: Witness Printer took 35.26ms. Allocated memory is still 83.9MB. Free memory was 49.3MB in the beginning and 45.1MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 10:51:30,064 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 38.4MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.65ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.0MB in the beginning and 50.7MB in the end (delta: -15.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.02ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 48.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.85ms. Allocated memory is still 69.2MB. Free memory was 48.6MB in the beginning and 47.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.43ms. Allocated memory is still 69.2MB. Free memory was 47.1MB in the beginning and 49.5MB in the end (delta: -2.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6618.92ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 48.9MB in the beginning and 49.3MB in the end (delta: -369.4kB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Witness Printer took 35.26ms. Allocated memory is still 83.9MB. Free memory was 49.3MB in the beginning and 45.1MB in the end (delta: 4.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_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] 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] [L251] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0] [L251] zero = base2flt(0, 0) [L252] 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] [L252] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=-2147483648, ea=0, ma=16777216, zero=0] [L252] a = base2flt(ma, ea) [L253] 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] [L253] RET, EXPR base2flt(mb, eb) VAL [a=2147483648, base2flt(mb, eb)=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, tmp=1, zero=0] [L263] sa = tmp VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [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 3 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1236 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1204 mSDsluCounter, 6533 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 13 IncrementalHoareTripleChecker+Unchecked, 4976 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 858 IncrementalHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 1557 mSDtfsCounter, 858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 717 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=5, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 502 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 648 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 789 ConstructedInterpolants, 2 QuantifiedInterpolants, 1312 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1139 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 274/313 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 10:51:30,091 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